'Exploration' pathfinding algorithm?
If you're more interested in wandering than exploring, you could get some good results fairly easily by adjusting the costs for your A* algorithm. eg. have the cost of a node on the map be increased significantly if you've already visited it. That will make your characters favour 'the path less travelled' when heading to your random destination.
This topic is closed to new replies.
Advertisement
Popular Topics
Advertisement