Breadth First Search (BFS) in Python [Python Maze World- pyamaze]

preview_player
Показать описание
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 Breadth First Search (BFS).

(00:00) Introduction
(03:22) What is Queue
(04:49) Pseudocode
(08:18) Python Code Development

⭐⭐Depth First Search (DFS) Implementation:

⭐⭐A-star (A*) Search Implementation:

⭐⭐Comparison of DFS, AFS and A*

⭐⭐Dijkstra's Algorithm:

You can download the package as:
pip install pyamaze

Or you can copy the module code from here:

The used demo file is here :

How to use pyamaze module:

What is __name__=='__main__':

Here is the Playlist:

#Python #pyamaze #Python
Рекомендации по теме
Комментарии
Автор

Is there any way to find all posible paths?

mangutek
Автор

what's the point of the queue module if we can pretty easily simulate the behavior of a queue using list?

EW-mbih
Автор

Kudoos Bro! Loved to see such a clear and illustrative explanation by a fellow Pakistani CS lad 🇵🇰💚

lazarusifed
Автор

Hello, I found your documentation very useful but can you tell me more about how to handle it if someone wants to enter input and end points from the keyboard?

HuyNguyen-xxrr
Автор

Very clear tutorial..may Allah bless you..

inhazfahim
Автор

What if a cell is allowed to be visited at most thrice? How to implement this in the code?

jansernchang
Автор

At the end of pseudo code when you have found the goal cell, then how to traverse from (5, 5) to (1, 1)?

abuhurairah
Автор

Does the code in the video give the complete solution?

شهدعلي-غوم
Автор

Used this very differently. Created a custom maze like a car park and spawned actors as parked vehicles. Then used BFS to get the closest unused parking location. But the goal point is not being pushed to the bfs_path so i get a trace error saying the ksy cannot be found. Still trouble shooting it tho. Would see what I can do about this as i need to add 3 more vehicles and search the closest parking spot for a total of 4 vehicles . I will also upload code to github and share

oddfeeling
Автор

possible ways in diagonal means...? how to code?

neprositha
Автор

salamo alaykom thank you my brother for your clear explaination

babaabba
visit shbcf.ru