A-Star A* Search in Python [Python Maze World- pyamaze]

preview_player
Показать описание
Python Maze World

Explore the power of A* Search algorithm and its implementation using Python. In this video, we discuss informed search and how it improves efficiency. Using the pyamaze module, we build the A* algorithm, showcasing its visualization capabilities. Watch as the algorithm intelligently navigates mazes, finding the optimal path from start to goal. Whether you're a beginner or an experienced programmer, this tutorial will equip you with the knowledge to apply A* Search in your projects. Join us and uncover the magic of intelligent pathfinding with Python!

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 A Star Search.

(00:00) Introduction
(01:30) Algorithm Explanation
(08:50) Priority Queue
(09:35) Pseudocode
(11:17) Python Code Development

⭐⭐Discussion on different Heuristic Functions in A-Star

⭐⭐Depth First Search (DFS) Implementation:

⭐⭐Breadth First Search (BFS) Implementation:

⭐⭐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
Рекомендации по теме
Комментарии
Автор

The amount of effort you have put in these videos is amazing. I just coded all these algos on a mobile app using Flutter framework. Thank you for this 💚

WaseekAhmad
Автор

I am a student in Com Sci and this was very well explained, thank you!!

zladsmusic
Автор

Your videos are so informative, please create a Genetic algorithm too in the future. thanks for the excellent job

Ogachi
Автор

Excellent video with great explanation. Thanks a lot!

anwar-gckv
Автор

hi! I come from the other video (dijkstra) and mate, I shall comment here too, it is a life saver, I've been trying to find something like this for hours after trying a hole week to program something like that with pygame, tkinter and some other things, but mate }you really did well, again thank you

JHOHANSTIWARGIRALDOESCALANTE
Автор

The code explanation was a bit fast but I will try it on my machine once and maybe I will get it then but thank you good work

yourtravelpostcard
Автор

Towards the end, I am confused at the part where only the highlighted part is getting separated. How exactly does that happen?

mals
Автор

How could I cache visited states (children) to improve computation speed? Also thank you for a wonderful explanation!

ignatiolu
Автор

I installed pyamaze as indicated in the video, but whenever I try to execute, I always get : ImportError : No module named pyamaze. I checked the installation, and it has been confirmed that it was installed in my python 3.6 version, and I don't get any syntax or wahtever error in the code neither. Do you know what the problem might be? Documentation is not really available ://
And thank you in advance !

amethyst
Автор

I wish this was doing using pacman. Great video though. Thanks

edmundquarm
Автор

great video, I learned a lot
Thanks!

hieuvameomeo
Автор

good video, can you please upload a video where you implement bfs in order to solve the knapsack problem

babaabba
Автор

Sir i am getting error at
aStar(m)
And
currCell = open.get()[2]
as
TypeError int object is not subscriptable

anikethpatil
Автор

How can we change the end and start coordinates?

shivamdixit
Автор

Assalam_O_Alaikum! Sir if there is no path in the maze then is it still work? If not then what conditions we should add and where we should add them so that if there is no path then this program terminate and print some message like "no path found"?

onemore
Автор

How for cell (2, 4) : West & South are open.
Ref: 12:43
Ref: 12:11

West Cell is open? How?
I can see only South cell is open 😨

#please kindly clear my confusion anyone

HONKAI_WORLD_OF_JOY
Автор

Sir, I am getting an error in line 23, m.maze_map[currCell][d]==True

eshasharma
Автор

I follow each lines of your code in this video and I got errors at line, path = aStarSearch(m) and line, = cell. This might be wrong with insertion into dictionary (same key). How can I fix this? Please help

anwar-gckv
Автор

search length (visited nodes) ? how did u do ?

ctrlintelligence
Автор

what do you mean by g sore and f score?

osama