Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

thats also not a correct formulation of the problem, as it needs to minimize the number of fire tiles it passes through. which is where a lot of the complication comes from.


Solve once for each number of fire tiles n.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: