Hello I have written a nice little versus space game - a bit like Space War - but viewed side on. There are some platforms and dynamic objects and my enemy spaceship needs to pathfind round them to get to the player.
I am going to extend the game later on - so it is essential I have a proper pathfinding routine. (platforms will be destroyed or have holes in them)
What I would like is a routine which could come up with 5 different routes and then I would randomly choose one. I would want one of these routes to be the fastest/shortest route and the others to be quite varied and going in different directions so the enemy has some variety in tracking the player.
I have managed to convert my game area and dynamic objects into a grid array.
Can someone point me in a direction of a pathfinding routine, that can find routes like I require - ie not just the shortest route. Thank you very much
I am going to extend the game later on - so it is essential I have a proper pathfinding routine. (platforms will be destroyed or have holes in them)
What I would like is a routine which could come up with 5 different routes and then I would randomly choose one. I would want one of these routes to be the fastest/shortest route and the others to be quite varied and going in different directions so the enemy has some variety in tracking the player.
I have managed to convert my game area and dynamic objects into a grid array.
Can someone point me in a direction of a pathfinding routine, that can find routes like I require - ie not just the shortest route. Thank you very much