The hidden beauty of the A* algorithm - YouTube

Follow along using the transcript. Follow along using the transcript. New New New

00:00 Intro 01:38 Change the lengths! 06:34 What is a good potential? 12:31 Implementation 16:20 Bonus Tom Sláma's video: https://youtu.be/umszOeerdsU Patreon: https://www.patreon.com/Polylog Website: https://polylog.cc Github: https://github.com/polylog-cs/Astar/tree/main Blog: https://vasekrozhon.wordpress.com/2024/09/04/the-hidden-beauty-of-the-a-algorithm/ Some related stuff: -- One thing I did not mention is that Dijkstra's algorithm is designed to solve the problem of finding the shortest path from the start node to all other nodes of the graph. It does this job very well, in…

saved by

• Chloe Chia
• Aaron Pham

related reading

• A (Long) Peek into Reinforcement Learning | Lil'Loglilianweng.github.io
• Visualizing Algorithmsbost.ocks.org
• Beating Myers algorithm on large diffsjzhao.xyz
• What is the "Greedy Algorithm" and Why is it So Dangerous?youtube.com
• Dijkstra's algorithm - Wikipediaen.wikipedia.org
• Role Of Algorithmsmatklad.github.io
• Lecture 19: Dynamic Programming I: Fibonacci, Shortest Pathsyoutube.com
• Computer Scientists Establish the Best Way to Traverse a Graph | Quanta Magazinequantamagazine.org
• Calculus on Computational Graphs: Backpropagation -- colah's blogcolah.github.io
• Algebraic Path Finding | Iago Leal de Freitasiagoleal.com
• Your Transformer is Secretly an EOT Solver | Elements of a Vector Spaceelonlit.com
• Google Maps–it’s just one big graph : Networks Course blog for INFO 2040/CS 2850/Econ 2040/SOC 2090blogs.cornell.edu