3 ms·
Nice and simple, but I’m a big fan of Amit Patel / Red Blob Games articles on the subject, and more. The interactive visualisations really drive the point home,
by lloeki 7y ago
Nice and simple, but I’m a big fan of Amit Patel / Red Blob Games articles on the subject, and more. The interactive visualisations really drive the point home, and also tackle less usual stuff like hex grids and circular objects in dedicated articles.
Introduction:
https://www.redblobgames.com/pathfinding/a-star/introduction.html https://www.redblobgames.com/pathfinding/a-star/introduction...
Much, much more, with in depth notes, variants, optimisations, moving targets and obstacles...:
http://theory.stanford.edu/~amitp/GameProgramming/ http://theory.stanford.edu/~amitp/GameProgramming/
And other intriguing articles:
https://www.redblobgames.com/ https://www.redblobgames.com/
- dkersten 7y agoAmit Patels site made A* finally click for me. I’ve implemented breadth first search before and it was a nice moment when I realised that Dijkstra’s is a minor change to BFS and A* is just a one line change (plus the heuristic function) to Dijkstas’s. Very well written with nice interactive illustrations.
- ggambetta 7y agoAmit's articles are fantastic. I devoured them in my early gamedev days (late 90s / early 00s). I finally got to meet Amit at GDC in 2017, I hope I didn't go into fanboy mode too much! He's the nicest guy. Worth following on Twitter too: https://twitter.com/redblobgames https://twitter.com/redblobgames
- dkersten 7y agoOh, thanks for the twitter link! Followed. I also found his site in my early programming years (2000) but took many years before I finally actually implemented A* and found it’s actually not hard (at least not for a toy implementation).