Oh, you two nerds! You were working together all along, to advertise your videos to eachother. Thank you for doing that; I found two new nerds to follow, instead of just one.
This was my favorite puzzle of AoC '22, not too easy, not too hard, possible to do by partial brute-force, and gives a good chance for going back and optimizing after submitting the answer.
Thanks for sharing. Your animations are very helpful. I can't wait to use it in the class room. Also thank you for your list of software that you used. The use of AI image generators is an interesting option that I haven't thought of so far.
Very interesting! Came here from Polylog's A* video, which references your video, but then I saw that your video also references his video! How did you guys do this, which was first?! Either way, great video lol!
It was a collaboration (for some definition of the word :). The topic of the videos had some overlap so we decided to connect it this way. Thank you for the kind words!
this video is really good and well-explained! The only thing missing is having a few more example mazes for Theseus to dodge the Minotaur, just running through 3 or 4 of them in a few seconds each. It's always fun to unleash an algorithm on a bunch of examples to see if anything interesting happens!
Amazing animation and explanation! At first, it was difficult to understand the narration due to pronunciation, but I got used to it quickly 😆 Great job on colab with Polylog as well 👏👏👏
I am also a bit intrigued by the more efficient implementation of dijkstra algorithm mentioned in the video, do you mind give some hints or links on how to improve it? Thanks in advance!!
The main idea is removing the need to add a state to the heap multiple times, but updating it in the heap instead. To do this quickly, you need to track their positions in the heap, which you can do using a dictionary. After you change the value in the heap (always to a smaller one), you also need to bubble it up to make sure the heap's conditions are not broken.
Oh, you two nerds! You were working together all along, to advertise your videos to eachother.
Thank you for doing that; I found two new nerds to follow, instead of just one.
Who is the second nerd to follow.?
This was my favorite puzzle of AoC '22, not too easy, not too hard, possible to do by partial brute-force, and gives a good chance for going back and optimizing after submitting the answer.
Thanks for sharing. Your animations are very helpful. I can't wait to use it in the class room. Also thank you for your list of software that you used. The use of AI image generators is an interesting option that I haven't thought of so far.
Very interesting!
Came here from Polylog's A* video, which references your video, but then I saw that your video also references his video! How did you guys do this, which was first?!
Either way, great video lol!
It was a collaboration (for some definition of the word :). The topic of the videos had some overlap so we decided to connect it this way.
Thank you for the kind words!
this video is really good and well-explained! The only thing missing is having a few more example mazes for Theseus to dodge the Minotaur, just running through 3 or 4 of them in a few seconds each. It's always fun to unleash an algorithm on a bunch of examples to see if anything interesting happens!
Just started an AI course at my uni, but the professor is so confusing. This was a great introduction to the first few modules of my course thank you!
This is really cool! Applying pathing algorithms to state space is something I haven't dived deeply into before! It seems really cool!
Love IT! Dneska jsem kódil babylonskou věž, v pondělí mě čeká zkouška. Je to velice nápomocné. Náhodou jsem zjistil, že koukám na video od Tebe. :D
Amazing animation and explanation!
At first, it was difficult to understand the narration due to pronunciation, but I got used to it quickly 😆
Great job on colab with Polylog as well 👏👏👏
Brilliant, thanks for a great watch!
Best videos ever! You and polylog have a great way of showing these algorithms more in depth and it is much appreciated. Thanks for the content!
The 3D board was mindblowing
crazy video. very nice explanation and I really really like that you build the code in an intuitive way along the video. great work!
very high quality video with detailed explaination, thanks for sharing.
Thank you that was a phenomenal video!
I loved that you included the code as well. Awesome video!
Great content! Thank you!
Very Good Video with good explaination. And very good use of animation to explain things . Like to see more videos like this.
Great sharing
This is a beautiful video.
Such a great video! Please keep that coming!
Amazing animation, really great work!
this is an awesome video! fun and clear. I wonder what tool do you use to generate these videos....
Great video, really satisfying visuals I just wanted to add that you could have done the wall-breaking version of the maze in O(n) using 0-1 BFS.
How would you go about solving it? The weights here are 1-10 so it isn't entirely obvious how you can do that.
Thanks
I am also a bit intrigued by the more efficient implementation of dijkstra algorithm mentioned in the video, do you mind give some hints or links on how to improve it? Thanks in advance!!
The main idea is removing the need to add a state to the heap multiple times, but updating it in the heap instead. To do this quickly, you need to track their positions in the heap, which you can do using a dictionary. After you change the value in the heap (always to a smaller one), you also need to bubble it up to make sure the heap's conditions are not broken.
Average Factorio player:
deque is not "deck" but "de queue"
great video man, but i had to keep pausing the video and seeking back to understand what you say because of your pronunciation of the words