Hacker News new | ask | show | jobs
by TylerGlaiel 1186 days ago
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.
1 comments

Solve once for each number of fire tiles n.