Between map travels can be easily solved with standard graph traversing techniques, but when i thought about within a map travel, i am not sure what would be a good approach.
Knowing that I have a jump limit of x
Reading in the map gives me an array of coordinates.
Do i need to specify specifically critical spots on the map (Eg. bridges) or should i let the algorithm figure out?
If I apply tree traversal techniques (breadth first for instance) I am not too sure if i will be able to get the route in less than a second.
Knowing that I have a jump limit of x
Reading in the map gives me an array of coordinates.
Do i need to specify specifically critical spots on the map (Eg. bridges) or should i let the algorithm figure out?
If I apply tree traversal techniques (breadth first for instance) I am not too sure if i will be able to get the route in less than a second.