I don’t know if you’ve already done a tutorial on this, but it would be nice if you could make a tuto on how to save your progress in a game/ file written in Python. 🙏
On algos he doesn't have a series(pls do one:), but on datastructures he has one playlist about them and he also has a video about the breadth first search here: th-cam.com/video/hettiSrJjM4/w-d-xo.html
dude to follow the 90 minute tutorial it took me 5 hours, to understand and i typed along. i can imagine the level of effort you put into this. this is my first video i saw on this channel and absolutaly loved it. i subbed.
My friend, only few people understand the joy and satisfaction of building something like this. I loved every minute of it. Thank you so much. Would be great to see a continuation into the topic of mazes - of course leveraging the the same grid-like visualization engine (aka the grid). It's a great foundation for all sorts of further grid-like problems and topics.
Oh man, I have been having a hard time for a past few days trying to make a A* algorithm. And when I'm finally done with it, this just pops up :D nevermind, going to watch the whole thing, might learn a thing or two! Love your vids mate, cheers from Slovakia
Love this tutorial. Still working on getting my own built. Great fun. Really like the graphics, and learning pygame. Have done a few things differently -- more classes, fewer variables, visualization tools for the A* algorithm (e.g. coloring neighbors 'light blue'). I am 79 years old and started teaching myself python a year ago, working with the Mandelbrot set. I needed to take a break with something different, and this tutorial gave me the perfect venue. I've used many of your great tutorials over the last year. Thank you!
I usually never leave comments but I felt like you deserve one. I am doing a project for school and had no clue how to start but I found this and it got me going on the right track and was a great intro to pathfinding. Thank you so much for all your work to make this video.
Been watching your videos for time man. I felt I've grown with you lol. Everyone who watches this guy we all come a long way from where we started no giving up!
I have to say man I really appreciate your videos, I learn a lot with them, since I'm a beginner I really appreciate the way you teach. have been watching you for 2 years by now, in 2020 I was working in a personal project an offline pc voice assistance and a very useful part of the program I learned here with you , unfortunately lost my computer, but the more I see theses videos, I get even more motivated to not give up on my dream of becoming a proper programmer, you really o inspire me to keep on going. Thanks man.
im setting up an a* algorithm for a university project that I will then optomise using heap optimisation and this made my life so much easier thanks for the help and so well explained
I think i would love to see a full video dedicated to algorithms. There we could learn about other algorithms and how to implement them. I am currently working on a large social media project, and I need to implement some algorithms. Please I really need this tutorial. Thanks man
I've just watched this 1.5hr clip in one go since it was enjoyable and very helpful. Towards the end you went 2x while my brain was like 0.5x 😂. Thank you so much!!
the algorithm here is so advance and the I'm so thankful that there's a guy who would very much made this code public and try to explain it while coding it again and I guess, a lot of time is surely alloted into this program , well appreciated. Thank you so much! so much appreciated for me because I'm just starting out in python, trying to learn some stuffs. thank you again for the effort of bringing a quality content!
This is an excellent tutorial, but for everyone I suggest you look sebastian lague explanation too.. 2 people explaining with different approach is really helping. Thank you Tim please continue this kind of algorithm visualization project, especially sorting with graphs
Thank you for this class, it was a good refresher. By the way you are using a lot of state transition. you only need 2 functions for that part, 1 to read the state and another one to write the state RED = (255, 0, 0) CLOSED = RED GREEN = (0, 255, 0) OPEN = GREEN BLUE = (0, 0, 255) YELLOW = (255, 255, 0) WHITE = (255, 255, 255) BLACK = (0, 0, 0) BARRIER = BLACK PURPLE = (128, 0, 128) PATH = PURPLE ORANGE = (255, 165, 0) START = ORANGE GRAY = (128, 128, 128) TURQUOISE = (64, 224, 208) END = TURQUOISE def is_state(self, queryColor): return self.color == queryColor. def set_state(self, queryColor): self.color = queryColor e.g. if you want to know if a spot is a barrier spot: call: aSpot.is_state(BARRIER) if you want to set a spot to a path point, call aSpot.set_state(PATH) Your colors get mapped to transition states, and you write fewer functions
Hey Tim! Keep up the great work! 😊👍 And at 1:30:00 in the video :- I feel You can add : "start.make_start() " too , along with " end.make_end() " So , that way BOTH our Start and End nodes are highlighted with their respective colors... So it looks like: if current == end: reconstruct_path(came_from , end , draw) end.make_end() start.make_start() 👈 return True Just a small addition to the code...But Great job Tim😊 Love that you put the effort and time to teach all of this 👍
Thank you!!! I mean I already passed Algorithms and data structures at uni but your explanation was much better AND i got it to work! Great tutorial!! Your effort was not in vain!
Wow, amazing tutorial, I wanted to make A* visualization for quite a while now but I couldn't get myself to it since it seemed too complex but I'm so glad I finally fully understand it, thanks. You could make some more videos about more advanced concepts in python, I really enjoy those.
I cant be the only one that noticed he explained the f_score = the heuristic like 3 times (when coding it)? otherwise great tutorial, a little hard to follow at one point, but much better then any other I've seen :D
great content Tim. I do want to clarify one thing though, and you can fix me if you with to the art of coding is more of an ongoing process, rather than a one sit occurrence. what I mean by that is sure, we can watch a one-hour youtube video, where it seems as if an entire program is easily written in no time, but once you follow along completely, the learning curve you experience may hit a plateau faster than you might think. I believe we should all take videos like this as merely general guidance and for better understanding the scopes of the task at hand. do the rest yourself - which means - a lot of googling, a lot of debugging, but also way more fun and enriching.
I've really enjoyed this tutorial. In the version I built I've added a 700 ms wait after the main draw command. It's wonderful for visually tracking how the A* algorithm selects the squares for the path. I'd like to paste a QuickTime view of that program in here. But I don't know how to do it.
Thanks so much but PLEASE, and I mean PLEASE, make a video on another maze solving algorithm like the follow the wall one, and keep it how you can input the maze by clicking each cell. thanks! 🙏🐹
Great tutorial, love it a lot. Sometimes I would have prefered if you went more in-depth explaining your process/thoughts, instead of saying "it doesn't matter right now". As I feel some parts where a bit rushed. nonetheless, still awesome! Learn a lot!
Hi alright! Congratulations on the content. If I may, I'd like to give you a tip on optimizing the code. In function draw_grid(), line 167, the loop "for j . . ." should be outside the " loop for i . . .". As it stands it's too costly, and unnecessary, because for every horizontal line, all the vertical lines are being drawn 50 times. this simple TAB recoil in the function, will exponentially reduce the cost of your code. Sorry for my bad english. RSRSS
Hi Tim. I want to thank you for your effort making this project, you helping us learning new things in Artificial Inteligence. But in your source code i found a small mistake. In line 11 you wrote that color Blue displays as (0,255,0). This color actually is Green, you should change to (0,0,255). This is the right representation for colour Blue in RGB color model. Your job is amazing keep going With friendly greetings from Greece
What other tutorial so you want to see?!
hey tim how are you doing
I don’t know if you’ve already done a tutorial on this, but it would be nice if you could make a tuto on how to save your progress in a game/ file written in Python. 🙏
Please make video on sorting algorithm visualiser
Make a video on alpha-beta pruning
Hey, can you make a wallpaper app program tutorial, or any other tutorial which we can make easily? Thanks 😊
Tim, a whole series on Ds/algs would be fantastic.
Tim must do this
Yes please make a series on ds/algo
On algos he doesn't have a series(pls do one:), but on datastructures he has one playlist about them and he also has a video about the breadth first search here: th-cam.com/video/hettiSrJjM4/w-d-xo.html
Yes please
Absoulutely agree with this, please Tim read this, cause it will be super helpful 🙏🏻
I saw this video last night, wanted to add it to my portfolio, woke up this morning and made it. Thank you so much Tim! You're the best!
I want to do the same bud can you please elaborate ass to where did you add it? Portfolio as in resume?
@@AnubhavSharma-e6r Yes, create a github repo of it then you can add it to a resume if you want
dude to follow the 90 minute tutorial it took me 5 hours, to understand and i typed along. i can imagine the level of effort you put into this. this is my first video i saw on this channel and absolutaly loved it. i subbed.
My friend, only few people understand the joy and satisfaction of building something like this. I loved every minute of it. Thank you so much.
Would be great to see a continuation into the topic of mazes - of course leveraging the the same grid-like visualization engine (aka the grid). It's a great foundation for all sorts of further grid-like problems and topics.
yes sir!
On the contrary. A great deal of people do understand the joy.
Oh man, I have been having a hard time for a past few days trying to make a A* algorithm. And when I'm finally done with it, this just pops up :D nevermind, going to watch the whole thing, might learn a thing or two! Love your vids mate, cheers from Slovakia
Love this tutorial. Still working on getting my own built. Great fun.
Really like the graphics, and learning pygame.
Have done a few things differently -- more classes, fewer variables, visualization tools for the A* algorithm (e.g. coloring neighbors 'light blue').
I am 79 years old and started teaching myself python a year ago, working with the Mandelbrot set. I needed to take a break with something different, and this tutorial gave me the perfect venue.
I've used many of your great tutorials over the last year. Thank you!
Im dying on the fact i was LITERALLY doing this yesterday, this would have made it SO EASIER
Always better to do tough things solo, then learn from the more experienced ;)
I usually never leave comments but I felt like you deserve one. I am doing a project for school and had no clue how to start but I found this and it got me going on the right track and was a great intro to pathfinding. Thank you so much for all your work to make this video.
Been watching your videos for time man. I felt I've grown with you lol. Everyone who watches this guy we all come a long way from where we started no giving up!
Finally!! I waited so long for this!
This video is ocean of programming knowledge
Will watch it at least 10 times and also recreate this on my own after learning
stfu fanboy.. im the best programmer in the world. :)
I cant belive it! I was the one asking for it, cant believe you took the idea!!
you must have been an genius to learn this. It took me a long time to understand this.
I have to say man I really appreciate your videos, I learn a lot with them, since I'm a beginner I really appreciate the way you teach. have been watching you for 2 years by now, in 2020 I was working in a personal project an offline pc voice assistance and a very useful part of the program I learned here with you , unfortunately lost my computer, but the more I see theses videos, I get even more motivated to not give up on my dream of becoming a proper programmer, you really o inspire me to keep on going. Thanks man.
Tim, I have been watching your videos for a while now and I just want to say you are a legend man
I can’t believe how much knowledge you have, congratulations and greetings from Mexico!
im setting up an a* algorithm for a university project that I will then optomise using heap optimisation and this made my life so much easier thanks for the help and so well explained
I think i would love to see a full video dedicated to algorithms.
There we could learn about other algorithms and how to implement them.
I am currently working on a large social media project, and I need to implement some algorithms.
Please I really need this tutorial.
Thanks man
I've just watched this 1.5hr clip in one go since it was enjoyable and very helpful. Towards the end you went 2x while my brain was like 0.5x 😂. Thank you so much!!
Great stuff Tim, I really aspire to be like you !
Last minute project. Lifesaver. Totally recommended.
Congratulations in advance for reaching 1 million subscribers!
you the man, I really needed this project. Almost done with my bootcamp(A/a) and needed a fun break from studying, this was perfect. Cheers!
the algorithm here is so advance and the I'm so thankful that there's a guy who would very much made this code public and try to explain it while coding it again and I guess, a lot of time is surely alloted into this program , well appreciated. Thank you so much! so much appreciated for me because I'm just starting out in python, trying to learn some stuffs. thank you again for the effort of bringing a quality content!
You're an absolute legend bro. Top notch tutorial.
虽然听不懂英语但是感谢你的视频我最近在学习A*
COLORS
RED = (255, 0, 0)
GREEN = (0, 255, 0)
BLUE = (0, 0, 255)
YELLOW = (255, 255, 0)
WHITE = (255, 255, 255)
BLACK = (0, 0, 0)
PURPLE = (128, 0, 128)
ORANGE= (255, 165, 0)
GREY = (128, 128, 128)
TURQUOISE = (64, 224, 208)
a lifesaver
thank you!
thank you so much!
I used this too lol thanks
tysm
Was looking forward for this. You're simply awesome! Keep up the good work
Bro i was literally researcing for this the whole day , you're a godsend 🙏
Thanks, this helped me learn a lot. I joined as a member since you make such great content
Finally!!!!!! The wait is over for the Path Finding Video. I have waited for this for a long time. Not able to find the best one. Thanks a lot man
*when you are literally typing alongside the entire tutorial in the same IDE and you still get errors
Which IDE is it?
@@CptJellyfish99 sublime text
Thanks!
Yes, I am facing the same problem.
Can you please tell me how to fix it sir!
You couldn’t have followed the entire thing exactly because I did and didn’t get a single error
This is an excellent tutorial, but for everyone I suggest you look sebastian lague explanation too.. 2 people explaining with different approach is really helping. Thank you Tim please continue this kind of algorithm visualization project, especially sorting with graphs
searched almost everywhere for this finally landed up here, mission accomplished
I have to say the new thumbnails you have made are very good.
Thank you for this class, it was a good refresher.
By the way you are using a lot of state transition.
you only need 2 functions for that part, 1 to read the state and another one to write the state
RED = (255, 0, 0)
CLOSED = RED
GREEN = (0, 255, 0)
OPEN = GREEN
BLUE = (0, 0, 255)
YELLOW = (255, 255, 0)
WHITE = (255, 255, 255)
BLACK = (0, 0, 0)
BARRIER = BLACK
PURPLE = (128, 0, 128)
PATH = PURPLE
ORANGE = (255, 165, 0)
START = ORANGE
GRAY = (128, 128, 128)
TURQUOISE = (64, 224, 208)
END = TURQUOISE
def is_state(self, queryColor):
return self.color == queryColor.
def set_state(self, queryColor):
self.color = queryColor
e.g. if you want to know if a spot is a barrier spot:
call: aSpot.is_state(BARRIER)
if you want to set a spot to a path point,
call aSpot.set_state(PATH)
Your colors get mapped to transition states, and you write fewer functions
Thanks for sharing Tim, much appreciated as always.
You're my new sensei 🙏🏽🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥
tim my dude you should put ads on these i dont thinnk anyone would complain + you deserve the adsense money bestie
Hey Tim! Keep up the great work! 😊👍
And at 1:30:00 in the video :-
I feel You can add :
"start.make_start() " too , along with " end.make_end() "
So , that way BOTH our Start and End nodes are highlighted with their respective colors...
So it looks like:
if current == end:
reconstruct_path(came_from , end , draw)
end.make_end()
start.make_start()
👈
return True
Just a small addition to the code...But Great job Tim😊 Love that you put the effort and time to teach all of this 👍
Thank you for the video. I am grateful for your time and contribution. Kind regards, Akira.
Thank you!!! I mean I already passed Algorithms and data structures at uni but your explanation was much better AND i got it to work!
Great tutorial!! Your effort was not in vain!
i finished my visualizing project just yesterday and today tim uploaded this amazing video 😀...
Great video Tim, thanks for making this 👍
Regards, keep up the good work!
You got a terrific ability to explain! Thank and keep it up 👍👍👍
Thank you Tim!! Total Lifesaver!
Awesome vid man! I’m loving it!
I was waiting for this, thank you ❤️
Thank you very much for this tutorial man Love it and great effort
very helpful, thanks for your tutorial that I can pass my final project
I learnt so much going through this tutorial. Thank you so much for all the hard work you put into it.
Wow, amazing tutorial, I wanted to make A* visualization for quite a while now but I couldn't get myself to it since it seemed too complex but I'm so glad I finally fully understand it, thanks.
You could make some more videos about more advanced concepts in python, I really enjoy those.
Thank you tim! I am using the algorithm you taught me to apply in with a robot simulation (Ros and gazebo) after using SLAM to get the map!
this video is blast for us.
i love these kind of videos
it helps me a lot
hope you will do more videos like this.
omg man, you are just fantastic, luv the content and explanation tnx bro
Awesome video , I have been searching for this type of video only ,you have explained it well , Thanks
Thank you very much! I will take my place in the corner now.
I cant be the only one that noticed he explained the f_score = the heuristic like 3 times (when coding it)? otherwise great tutorial, a little hard to follow at one point, but much better then any other I've seen :D
Thank you so much,been waiting for this for a long time!
This video helped me for my project in AI. Thank you so much
Love your videos tim!
Love your comments ;)
hello
Great tutorial Tim !!!!!!!!!!!!!!!!!!!!
great content Tim.
I do want to clarify one thing though, and you can fix me if you with to
the art of coding is more of an ongoing process, rather than a one sit occurrence.
what I mean by that is sure, we can watch a one-hour youtube video, where it seems as if an entire program is easily written in no time, but once you follow along completely, the learning curve you experience may hit a plateau faster than you might think.
I believe we should all take videos like this as merely general guidance and for better understanding the scopes of the task at hand.
do the rest yourself - which means - a lot of googling, a lot of debugging, but also way more fun and enriching.
i guess you could say that we should take a heuristic approach
I've really enjoyed this tutorial. In the version I built I've added a 700 ms wait after the main draw command. It's wonderful for visually tracking how the A* algorithm selects the squares for the path. I'd like to paste a QuickTime view of that program in here. But I don't know how to do it.
You're a genius mate, works a treat and I used Atom instead of Sublime ^_^
THANK YOU!!!! This helped me so much for my assignment :)
Tim, thank you for your effort and this video. Really enjoyed it.
This is My Jam!
Very cool visualization setup.
Working on a similar thing in C++, curious to see how it's done in Python
Amazing tutorial, thank you so much for helping the community to learn in an easy and fascinating way, keep up the good work man.
I will be your petreon immediately once i get the job buddy. GBU !
WHOLESOME VIDEO thank you so much
Great Video Tim.
you are very good at explaining stuff
Very inspiring person! Clear speech, great code, very concise.
This is absolutely wonderful explanation!
Great job. Actually understanding a coding tutorial
Thank you boss for this wonderful video
I love you!!! I've been waiting for this ♥️♥️♥️♥️♥️♥️♥️♥️
Thank you so much for your work and dedication !
You are a legend dude, ty so much!
Thanks so much but PLEASE, and I mean PLEASE, make a video on another maze solving algorithm like the follow the wall one, and keep it how you can input the maze by clicking each cell. thanks! 🙏🐹
Yes this was amazing... I want more algorithm videos
Have you ever considered making a tutorial of how you created this in python and blender? 🤓👍 Very nice!
Great tutorial, love it a lot. Sometimes I would have prefered if you went more in-depth explaining your process/thoughts, instead of saying "it doesn't matter right now". As I feel some parts where a bit rushed.
nonetheless, still awesome! Learn a lot!
thank you for such great videos..
Glad you like them!
very very useful, thanks so much. Please more video like this
Amazing Tutorial
Thanks a Lot bro!!!!
Thanks for this video, really good job!
Thanks for the video man i learned a lot :)
Thanks a lot. This was brilliant!
Great tutorial! Thank you for your help.
I think this is just understandable if you have prior knowledge about this topic
Thank you so muchhh.... You are really brillant..✨
amazing Tim thank you so much
Hi alright!
Congratulations on the content.
If I may, I'd like to give you a tip on optimizing the code.
In function draw_grid(), line 167, the loop "for j . . ." should be outside the " loop for i . . .". As it stands it's too costly, and unnecessary,
because for every horizontal line, all the vertical lines are being drawn 50 times.
this simple TAB recoil in the function, will exponentially reduce the cost of your code.
Sorry for my bad english. RSRSS
Hi Tim.
I want to thank you for your effort making this project, you helping us learning new things in Artificial Inteligence.
But in your source code i found a small mistake. In line 11 you wrote that color Blue displays as (0,255,0). This color actually is Green, you should change to (0,0,255).
This is the right representation for colour Blue in RGB color model.
Your job is amazing keep going
With friendly greetings from Greece
Thank you, just what I wanted more advanced data structures and algo stuff please .
Appreciate your work
This was awesome!