3 ms·
That algorithm (implemented efficiently) is just A* using a different concept of distance. The distance specifically would be `fire*episilon + steps if steps <
by thethirdone 4y ago
That algorithm (implemented efficiently) is just A* using a different concept of distance.
The distance specifically would be `fire*episilon + steps if steps < max else inf`
- laserbeam 4y agoIt doesn't work if you just change the distance. Having implemented similar variations of A* I agree with Tyler. You need to change more than distance to get this to work. Usually you need to change the search space and increase the number of states you go through to get the algorithm to differentiate between things you want and things you don't want to happen in your final result.