This is an experiment in creating randomly connected nodes all trying to upset the A* search algorithm by moving apart as soon as the algorithm finds the shortest path. They don’t always succeed. 🙁
Left click near the nodes to disturb them.
Right click (or space bar) to see how the algorithm works.
Press ‘c’ to generate a new random set of nodes.
7 Comments
Very nice visualisation 🙂
Thanks Alejandro! 🙂
I am very envious of you… I wish I had time for learning processing in order to visualize every algorithm,, It’s really interesting …
Lovely!
Thanks Mehrdad, Jyoti. 🙂
Good job man…inspirational work.
Cool site, perhaps this is useful in solving simultaneous equations iteratively. Or at least something neat to watch in the background while Excel does it’s magic.