A* Search Fun

By Keyvan | Published: 24 October 2009



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.

This entry was posted in General. Bookmark the permalink. Both comments and trackbacks are currently closed.

7 Comments

  1. Alejandro says:
    24 October 2009 at 8:39 pm

    Very nice visualisation 🙂

  2. Keyvan says:
    24 October 2009 at 10:18 pm

    Thanks Alejandro! 🙂

  3. Mehrdad says:
    24 October 2009 at 11:28 pm

    I am very envious of you… I wish I had time for learning processing in order to visualize every algorithm,, It’s really interesting …

  4. Jyoti Mishra says:
    25 October 2009 at 2:50 pm

    Lovely!

  5. Keyvan says:
    25 October 2009 at 9:41 pm

    Thanks Mehrdad, Jyoti. 🙂

  6. Oduor ENO says:
    11 November 2009 at 10:16 pm

    Good job man…inspirational work.

  7. Trent says:
    19 November 2009 at 9:28 pm

    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.