As promised, here is the
project experiment that I originally wrote the pathfinder algorithm for.
[kml_flashembed movie=”http://www.rubenswieringa.com/blog/wp-content/uploads/2008/pathfinderdemo06.swf” width=”400″ height=”375″ /]
Here’s how it works: ‘Organisms’ (the colored moving squares) are thrown into an infrastructure (a collection of connected points, i.e. the circle/star with connected dots). Each organism is assigned a certain destination-point within the infrastructure and carries with it a pathfinder (a polished version of the algorithm I posted about some time ago).
The pathfinder will figure out which points to travel (trial and error, guessing together a route to the assigned destination, see previous post) in order to reach the destination and will then tell its organism where to go.
When two organisms happen to travel the same connection (line between two points in an infrastructure) they will share and compare their knowledge about several of the paths they have traveled, this is visualised by both organisms becoming semi-transparent.