Introduction to A*: http://stanford.io/1gze9d7 – awesome multi-page rewarding read (via: Ilya Grigorik – Google+)
Posted by jpluimers on 2014/04/16
Today, Ilya Grigorik wrote a nice G+ entry with this pointer:
Introduction to A*: http://stanford.io/1gze9d7 – awesome hands-on overview of the A* pathfinding algorithm. Long but rewarding read.
Well, the long read is indeed long, and on my stack of things to read.
Ever since the early 1990s when the original DOS version of NS Reisplanner came out (with a really bad algorithm for finding train rides) I’ve been interested in this, but never found a really good hands-on introduction.
Now there is one (:
These are the individual pages:
- Introduction to A*.
- Heuristics.
- Implementation notes.
- Variants of A*.
- Dealing with moving obstacles.
- Space used by precalculated paths.
- Map representations.
- Long and short term goals.
- Movement costs for pathfinders.
- User experience with shortest paths.
- Applications.
- AI techniques.
- References.
–jeroen
via: Ilya Grigorik – Google+ – Introduction to A*: http://stanford.io/1gze9d7 – awesome….
Leave a Comment