A visualiser for a path finding bot that solves this leetcode question.
This program brings a visualisation to the 'depth first search' algorithm and how it can be applied to find all valid pathes.
- A valid path is a path from start to finish that coverse EVERY square.
- Python 3.0.0+
- MatPlotLib
pip install matplotlib - Glob
pip install glob - NumPy
pip install numpy - ImageIO
pip install imageio
Go into /src/pathFinderBot.py and modify these variables at the bottom.
grid= Configure the grid for the bot to manuevere. (-1: Obstacle, 0: Nothing, 1: Robot, 2: Finish).render= Enables rendering to the frames folder and tries to create a GIF of atmovie.gif.print= Enables printing to the console of recursive algorithm.