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. Post a comment or leave a trackback: Trackback URL.

7 Comments

  1. Alejandro
    Posted 24 October 2009 at 8:39 pm | Permalink

    Very nice visualisation :)

  2. Keyvan
    Posted 24 October 2009 at 10:18 pm | Permalink

    Thanks Alejandro! :)

  3. Mehrdad
    Posted 24 October 2009 at 11:28 pm | Permalink

    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
    Posted 25 October 2009 at 2:50 pm | Permalink

    Lovely!

  5. Keyvan
    Posted 25 October 2009 at 9:41 pm | Permalink

    Thanks Mehrdad, Jyoti. :)

  6. Oduor ENO
    Posted 11 November 2009 at 10:16 pm | Permalink

    Good job man…inspirational work.

  7. Trent
    Posted 19 November 2009 at 9:28 pm | Permalink

    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.

Post a Comment

Your email is never published nor shared. Required fields are marked *

*
*

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>

Subscribe without commenting