2010/3/6 Jon Harper <[email protected]>
Hi everyone, here's a picture of Samuel's A* implémentation in action :
> The start is at the top left, arrival at the bottom right. The considered
> cells are in blue.
>
> http://imgur.com/aR0FJ.png
>
>
> [image: the image] <http://i.imgur.com/aR0FJ.png>
>
While it may seem strange at first to see partially explored paths, one has
to understand that A* is a breadth-first search augmented with an heuristic
(in this configuration the sum of X and Y distances since you can only walk
in four directions, no diagonals allowed). The algorithm may explore many
routes at the same time: when it gets farther from the goal, it may switch
to another partially explored path in case it is more promising after all.
Sam
------------------------------------------------------------------------------
Download Intel® Parallel Studio Eval
Try the new software tools for yourself. Speed compiling, find bugs
proactively, and fine-tune applications for parallel performance.
See why Intel Parallel Studio got high marks during beta.
http://p.sf.net/sfu/intel-sw-dev
_______________________________________________
Factor-talk mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/factor-talk
