Puzzles
loading puzzles...
Current
Goal
Solve Algorithm
The classic A* pathfinding algorithm. Usually faster than IDA, might run out of memory on harder puzzles. | |
The Iterative Deepening A* algorithm. Uses less memory than A*, but might take much longer. | |
Bidirectional search, will only work properly on puzzles that have a single solution position (no grey blocks). |
Info
No level loaded. Choose one from the list on the left.