demaxl / path-finding-visualiser

A software that visualizes popular classic search algorithms

Path Finding Visualizer

Introduction

This is a software that visualizes how a computer finds the shortest path from the start position to the end position in a maze using various search algorithms. I built this software to implement the search algorithms I learnt from taking Harvard's CS50 AI course.

---

About

The visualizations were made with a simple tkinter canvas. The actual process of the finding the path were done with these search algoritms

• Depth First Search
• Breadth First Search
• Greedy Best First Search
• A* Search

---

How to use

Requirements

• python 3.x

It starts on an empty 30 by 50 maze.

• The green box represents the start position. You can change it by clicking on it.

• The red box represents the goal position. You can change it by clicking on it.

• To draw obstacles click on an empty area anywhere on the maze, move mouse around to draw obstacles(represented by white) then click again to stop drawing.

• To erase obstacles right click on an empty area anywhere on the maze, move mouse around to erase obstacles then click again to stop erasing.

• You can specify the algorithm to use by changing the drop down list at the top.

• Hit <spacebar> to start the path finding.

• The pink boxes are the boxes that were explored when finding path and the yellow boxes trail is the path

• After its done hit <backspace> to reset maze.