Chennai at 3:11 PM
October 28, 2007
5 comments
For an excellent explanation of the A* algorithm wrt to the 8 puzzle :
Visit the A* algorithm tutorial
For those who don’t know what the A* algorithm is about, A* is one of the best path-finding algorithms that uses heuristics to search faster.
More on that in Wikipedia
Incidentally, I also found out that Dijkstra’s algorithm is actually a special case of the A* algorithm.
Scott Adams never ceases to amuse me. I’ve started following his blog lately and this is a little post about optimism was just too good ignore
This is the best Vim Vs Emacs article i’ve come across so far