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.
-
Notifications
You must be signed in to change notification settings - Fork 0
gabopupo/pathfinding
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A study in the differences of execution speed between two pathfinding algorithms in solving a 15-puzzle: a naive BFS-based and A-star.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published