DFS BFS and A* Search Comparison in Python [Python Maze World- pyamaze]

Python Maze World
In this series we will learn about different Maze Search Algorithm in Python e.g., Depth First Search (DFS), Breadth First Search (BFS), A-Star Search, Dijkstra's Algorithm and many other possible search and navigation algorithms like Wall Following Robot, Reinforcement Learning, Genetic Algorithm etc.

This video is about the comparison between DFS, BFS and A* Algorithm. The comparison will be done on the basis of length of the final path, length of the search path and the execution time plus the discussion on the memory complexity.
Moreover, there is discussion on the Heuristic function of the A-Star algorithm. The Heuristic function can be under-estimated or over-estimated. We will see the effect of those on the performance of the algorithm.

(00:00) Introduction
(01:09) DFS vs BFS
(09:51) BFS vs A-Star
(13:30) Under-estimated and Over-estimated Heuristic Function in A-Star



⭐⭐Depth First Search (DFS) Implementation:
https://youtu.be/sTRK9mQgYuc

⭐⭐Breadth First Search (BFS) Implementation:
https://youtu.be/D14YK-0MtcQ

⭐⭐A-star (A*) Search Implementation:
https://youtu.be/W9zSr9jnoqY

⭐⭐Dijkstra's Algorithm:
https://youtu.be/LGiRB_lByh0


You can download the package as:
pip install pyamaze

Or you can copy the module code from here:
https://github.com/MAN1986/pyamaze/blob/main/pyamaze/pyamaze.py

The used demo files are here :
https://github.com/MAN1986/pyamaze/tree/main/Demos/Comparison-DFS-BFS-AStar

How to use pyamaze module:
https://youtu.be/McMU-WuJwG0

Here is the Playlist:
https://youtube.com/playlist?list=PLWF9TXck7O_zsqnufs62t26_LJnLo4VRA

#Python #pyamaze #Python