This site requires JavaScript, please enable it in your browser!
Greenfoot back
djEthen
djEthen wrote ...

2013/4/17

Problem

djEthen djEthen

2013/4/17

#
Clara is learning to optimise her movement and for this to happen she must learn to count. One of the tasks set out for her is to compute the height of the longest line of trees. She must move from west to east and once reaching a leaf at the bottom right corner – she must present the value of the longest tree line she has encountered in the world. Please help me figure out so that she can reach from point a to b http://i910.photobucket.com/albums/ac307/djEthen/clara.png
Gevater_Tod4711 Gevater_Tod4711

2013/4/17

#
If you are trying to find the shortest way for the ladybird in the link to the leaf you should have a look at this scenario. There you can find the A* algorithm which is the best algorithm for pathfinding. This algorithm is used in almost all navigation system so it can't be wrong to use it.
djEthen djEthen

2013/4/18

#
Ohk.. thanks will look into it.
You need to login to post a reply.