a* pathfinding experiments
this demo shows several approaches to implementing an a* pathfinding algorithm.
1) grid based with 8 possible directions + single memory (last space only)
2) grid based with 4 possible directions + complete memory
3) ray based with zero memory
4) combination ray/grid + complete memory
environment is physically simulated, agents and player are spheres that roll around.
pathfinding allows the agents to "find" the player.
interactive demo (with source): [ballz.zip] (6mb)
2 Comments:
Humm it seems that you may have stopped updating your blog, however this pathfinding example is really usefull to a project I am working on, I dont suppose you would still have the complete project source anywhere? I would of course give you full credit for the code.
Awsome stuff.
Humm it seems that you may have stopped updating your blog, however this pathfinding example is really usefull to a project I am working on, I dont suppose you would still have the complete project source anywhere? I would of course give you full credit for the code.
Awsome stuff.
Post a Comment
<< Home