Visualization tool to demonstrate how different search algorithms work.
GPL-3.0 License
Path Finder is a visualization tool to demonstrate how different search algorithms work. I've created it while studying course Intro to Artificial Intelligence (https://classroom.udacity.com/courses/cs271). UI is built on Kivy framework (https://kivy.org/#home).
Install in two steps. Clone the repository and run provided script:
git clone https://github.com/tekian/path-finder.git
cd path-finder
.\pathfinder.bat (Windows)
./pathfinder.sh (Linux)
Provided scripts execute following steps:
PATH
)(Nothing else. No need to be paranoid. Read sources here and here.)
Run pathfinder.sh
or pathfinder.bat
depending on your platform. See Installation.
Application supports two modes of map generation:
X
, Y
and optionally how much % Edges to keep
(edge cost equals 1)It supports following search algorithms:
(Code wise, these algortihm differ only in calculated cost function. See the code for details.)
You can choose from two playback modes:
Step
every time you want to move forward with the searchStart
/Stop
the algorithmLast but not least, you can control Show options of nodes and edges at any time:
Contributions are welcome. If you have time, passion and idea, go ahead and create a pull request.