A study in the differences of execution speed between two pathfinding algorithms in solving a 15-puzzle: a naive BFS-based and A-star.
To compile it, type:
g++ astar-search.cpp -o astar-search -std=c++11 on terminal.
gabopupo/pathfinding
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|