Use loops to solve this problem.
Begin by writing an algorithm, using loops, to plan your program. For your
island, refer to the original file ZigZagLakes.jev. Also, there are 2 other
similar island layouts, ZigZagLakes2.jev and ZigZagLakes3.jev:
|
|
|
| 3 different possible islands | ||
Use your algorithm to design and place comments in your program. Place your first Jeroo at position (1,0), facing east, with no flowers. Place a second Jeroo at position (22,22), facing west, with 50 flowers (this should give you plenty for all island designs).
The first Jeroo should follow the trail of flowers around the lakes, going from the northwest to the southeast, picking each flower it finds along the way. It should stop at the shore. The second Jeroo should then follow the trail of nets from the southeast to the northwest. This Jeroo will disable each net as it comes to it by tossing a flower on it, stopping at the shore. At the end of the program, the first Jeroo and second Jeroo should each do a spin (360-degree turn) to celebrate what they have accomplished.
Include any methods that you think are appropriate. Part of your grade depends on your choice of loops and methods.
• Name your program "yournameZigZag.jsc" (your name in front).
• Create an algorithm that will help you plan the program using loops.
Hint: make an outer loop for the first Jeroo in your program so that it continues
as long as it has not yet reached the water (the south shore). Do something
similar for your second Jeroo.
• Grade will be based on decisions involving use of loops, following instructions,
appropriate comments and indentation.