15 puzzle solver. Uses bidirectional A* with Ken'ichiro Takahashi's walking distance heuristic.
python tests.py
This will run the solver on 20 randomly generated test cases.
| Name | Name | Last commit date | ||
|---|---|---|---|---|
15 puzzle solver. Uses bidirectional A* with Ken'ichiro Takahashi's walking distance heuristic.
python tests.py
This will run the solver on 20 randomly generated test cases.