A* Search Algorithm Explained: The Smarter Pathfinding Method 🚀
Discover how A* enhances Dijkstra's algorithm by considering goal direction, making pathfinding more efficient. Dr. Mike Pound breaks down the mechanics at Computerphile.
Computerphile
1.3M views • Feb 15, 2017
About this video
Improving on Dijkstra, A* takes into account the direction of your goal. Dr Mike Pound explains.
Correction: At 8min 38secs 'D' should, of course, be 14 not 12. This does not change the result.
Dijkstra's Algorithm: https://youtu.be/GazC3A4OQTE
How GPS Works: https://youtu.be/EUrU1y5is3Y
http://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: http://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com
Correction: At 8min 38secs 'D' should, of course, be 14 not 12. This does not change the result.
Dijkstra's Algorithm: https://youtu.be/GazC3A4OQTE
How GPS Works: https://youtu.be/EUrU1y5is3Y
http://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: http://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
1.3M
Likes
26.2K
Duration
14:04
Published
Feb 15, 2017
User Reviews
4.8
(254) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now