by auraham on 6/17/25, 7:25 AM with 103 comments
by apnorton on 6/18/25, 1:51 PM
Breadth-first Search: Priority is order of discovery of edges (that is, no priority queue/just a regular queue)
Dijkstra: Priority is distance so far + next edge distance
A*: Priority is distance so far + next edge distance + estimate of distance to target node.
This also helps me remember whether the estimate must over- or under-estimate: Since Dijkstra is making the estimate "0", clearly the "admissible heuristic" criteria must be an under-estimation.
by ecshafer on 6/18/25, 12:42 PM
by leftnode on 6/18/25, 4:47 PM
I spent hours painstakingly drawing similar grids that the author of this article made and manually doing the calculations [0]. I still have these notes somewhere, even though they're over 20 years old at this point, because I was so proud of the work I put into it.
At any rate, thanks for this article and the trip down memory lane.
[0] https://imgur.com/a/zRYaodL (apologies for the Imgur link)
by upghost on 6/18/25, 12:54 PM
by kazinator on 6/18/25, 8:00 PM
by k2xl on 6/18/25, 2:07 PM
I have found A* fascinating not because of the optimization but also from the various heuristics that can be built on top of it make it more generalized for other types of pathfinding.
Some devs have built solvers that use techniques like bidirectional search, precomputed pattern databases, and dead locking detection.
by 90s_dev on 6/19/25, 2:34 AM
https://juhrjuhr.itch.io/deep-space-exploitation/devlog/9454...
by lukeyoo on 6/18/25, 9:09 PM
by kriro on 6/18/25, 8:36 PM
AI a Modern Approach.
by cryptomic22 on 6/18/25, 3:28 PM
by mysteria on 6/18/25, 5:33 PM
by 0manrho on 6/18/25, 3:17 PM
by deadbabe on 6/18/25, 3:58 PM
by Kye on 6/18/25, 7:58 PM
by JohnKemeny on 6/18/25, 12:24 PM
Title should have a (2014) in it: Introduction to the A* Algorithm (2014).
1 points, 8 months ago, 1 comments: Introduction to the a* Algorithm (https://news.ycombinator.com/item?id=41897736)
202 points, 3 years ago, 30 comments: Introduction to the A* Algorithm (2014) (https://news.ycombinator.com/item?id=30287733)
4 points, 5 years ago, 1 comments: Introduction to the a* Algorithm (https://news.ycombinator.com/item?id=24146045)
201 points, 7 years ago, 14 comments: Introduction to A* (2014) (https://news.ycombinator.com/item?id=18642462)
5 points, 7 years ago, 0 comments: Introduction to A* (https://news.ycombinator.com/item?id=16190604)
by hoseja on 6/18/25, 12:29 PM
It's a performance hack, not how entities trying to get somewhere behave.