Ask HN: What's your favorite elegant/beautiful algorithm?

Re:Ask HN: What's your favorite elegant/beautiful algorithm? by otikik on Wednesday October 17, 2018 @07:29AM (#18237997)

I like the A* pathfinding algorithm. It's not particularly elegant or beautiful on itself, and it's very dependant on the heuristics applied & the topology of the terrain used. Yet the results tend to be quite pleasing to watch.

Also, it has a great website dedicated to it, with lots of interactive demos:

http://theory.stanford.edu/~amitp/GameProgramming/

[ Parent | on HN ]

Re:Ask HN: What's your favorite elegant/beautiful algorithm? by yellowflash on Wednesday October 17, 2018 @08:28AM (#18238282)

Actually it's pretty elegant by itself, Consider this all traversals are same,

val someDS;

while(!someDS.isEmpty()){

  addChildren(someDS.pop())

}

Now replace, someDs with

Queue -> BFS

Stack -> DFS

Priority Queue, with priority of distance so far -> Dijkstra.

Priority Queue, with distance + heuristic -> A*

Its beautiful.

[ Parent | on HN ]

Re:Ask HN: What's your favorite elegant/beautiful algorithm? by moftz on Wednesday October 17, 2018 @08:33AM (#18238320)

The development of "Shakey the robot" led to the discovery of A* along with a few other algorithms.

https://en.wikipedia.org/wiki/Shakey_the_robot

[ Parent | on HN ]