Do you ever wish that you could make your Jeroo turn around 180 degrees?
Example 2 of a Custom Method to “Go Around a net”
You can download the files for the animation below here
Category Archives: Jeroo
Scavenger Hunt and relay race
Relay Race
Objective: Three Jeroos (you give them names) are practicing for the Santong Relays. Figure 5 shows the course at the start of the race. The first Jeroo begins at (4,9) facing EAST. It must pick the flower and give it to the second Jeroo who begins at (7,13) facing NORTH. The second gives the flower to the third Jeroo who begins at (4,15) facing WEST. The third Jeroo must plant the flower at (3,16), run to (3,21) and stop
Scavenger Hunt
Objective:
- The Jeroos can only turn LEFT
- The Jeroos must take turns, each doing only thing in each turn: hop(), turn(LEFT), or pick()
- A Jeroo can only hop forward one space in its turn.
- Two Jeroos start at opposite ends of Long Island, one at (3,5) facing EAST, and one at (5,18) facing WEST. Each Jeroo is supposed to pick two flowers. The first one can be from anywhere along the edge of the island, and the second must be the one in the center. The first one to pick the center flower is declared the winner. There are a few rules to this scavenger hunt.
Jeroo Spelling Letters (python)
I. Copy and paste this code below in the Jeroo “IDE”. Run the code several times unti you understand what is going on, then try experimenting with the code, changing it around until you are comfortable with the basic methods of a Jeroo.
II.
Objective: Have a Jeroo spell out the lettter “Z ” in the same fashion as Part I
Picture of the finished project
III.
Objective: Have a Jeroo spell out the letter “O ” in the same fashion as Part I
Extra Credit Single Loop
Mazes 2
Mazes #2
Shunya Map 1
Shunya 4
Struhl Map:
- Start 20, 18
- go around the interior, get the flower, pick it up.
- 1 loop only
Heeyeon’s Map:
-
heeyeons_maze.jev
-
start Jeroo at (23,1) and pick up the flower at that location
-
go to (1,23)
- you may NOT pick a flower or visit a cell that has a flower (See animation at bottom)
Picture at start:
One Solution:
Brett’s Maze 2
Description: Start at 0,0, pick all the flowers then use them to toss() your way through the nets. bretts-maze2
George’s Map : Start at ( 10,0) , facing SOUTH, Use 1 loop and pick the flower
Paul’s Diagonal Map
Matt’s All Flower Map
Map name : matt_water_flower_map.jev
Directions: pick up all the flowers. Use 1 while loop. You can start and end wherever you want. Just make sure that the loop eventually terminates.
One strategy:
A Different strategy
Jar jar’s Haven:
Bismark’s Map
Directions: Pick all the flowers. Start anywhere ; end anywhere. Don’t die, Make sure the loop ends.
Diagonal Inwards
Fill up the Map
- * Use a blank map and have 2 Jeroos fill up every spot with a flower.
- Use a single loop (not an infinite one either)
Sota
EXTRA CREDIT:
Mazes 1
Objective: To use while loops to get the Jeroo to pass through each maze and get the flower. It is possible to write a solution to both of these mazes using a single while loop–albeit this loop will have several( about 5 or 6) if tests! It is important for this problem that you do NOT simply hand code this. To get an A on both of these assignments you must use 1 single while loop per maze.
Download All Island Files
island3-A
Shunya 3
Aliya’s Map
Mazes 2 (start in top left, 1 loop to pick flower)
Shunya 2
Yuna’s Original Maze
island-3-D (start in the top left, and get to the bottom right)
AlanasMessage_MAP.jev
4) ZigZag : Use 1 while loop (not infinite), follow the flowers, picking them up and use those flowers traverse over the nets. Notice where the Jeroo ends (ie your while loop condition)
5) Spell Z (Blank Map)
- start at 0 , 0 with 70 flowers.
- Use a single while loop to spell a letter z
Last and most definitely not least:
island3-C ** A+ assignment.
This is the deceptively hard and should be done last and only if you want that A+
Done all of the maps? Start on the next set here
Climb the Stairs
Start you jeroo in the bottom picture and have it climb to the flower. Use 1 and only 1 while loop.
climb-the-stairs__1.jev |
 |
 |
climb-the-stairs__2.jev |
|
 |
climb-the-stairs__3.jev |
|
 |
climb-the-stairs__4.jev |
|
 |
Hurdles
Objective: A Jeroo starts at the southwest corner of the island, location (23,0), facing East with no flowers. There is a flower somewhere east of the Jeroo. There are zero or more hurdles, represented by nets, between the Jeroo and the flower. Each hurdle is a rectangular arrangement of nets with its base along the Southern Sea. The height and width of each hurdle is unknown. The number of hurdles and the spacing between the hurdles is unknown. There is at least one row of empty cells along the top and sides of each hurdle. There are no water features and no other Jeroos on the island. The only nets are those that define the hurdles. The goal of this program is to have the Jeroo jump all of the nets, pick the flower, and stop. A representative island is shown in figure 1.
- start at bottom left
- with zero flowers
- use a single while loop
- you may only hop() a single space (ie no hop(2), hop(3), hop(n) )
- pick the flower that is (generally) located on the right
OneHurdle.jev
Solution : Not graded
two-hurdles.jev Not graded
ManyHurdles.jev
Not graded
Extreme Hurdles.jev 8/10
Description:Write an infinite loop that makes your Jeroo travel around the perimeter of the island. 9/10
Download this island file (steve’s maze)
- this gets you the 10/10
- use 1 while loop
- the Jeroo should travel in an infinite loop around the perimeter of the map.
jacob_icejet_map2 Extra credit
- this is extra credit
- 1 while loop
- start with zero flowers
- pick the one flower in the top right and use that to access the flower that is in the bottom middle.
Two Friends Meet
One Saturday morning, two friends, Bugs and Daffy, decide to meet and plant flowers to beautify Santong island. Daffy starts in the Northwest corner facing East with 90 flowers in his pouch. Bugs starts in the Northeast corner facing West with 90 flowers in his pouch. Bugs and Daffy begin hopping toward one another. As they hop, each plants exactly one flower at every location it enters, including its starting location. They meet, facing each other, roughly in the middle of row 0. After a handshake and a little small talk, Bugs and Daffy both turn toward the south and continue planting flowers all the way to the southern edge of the island. When both reach the South Sea, the say goodbye and part. Daffy turns west and plants flowers all the way to the Western Ocean. Bugs turns east and plants flowers all the way to the Eastern Ocean. This is where our story ends. Your task is to write a Jeroo program that will illustrate this story.
One possible solution to this project is represented in the picture below
Jeroo Walk The Lake with Loops
Original Project Descriptions is here
Acknowledgement This problem is adapted from one that was created originally by Erica Eddy of The University of Wisconsin – Parkside.
Your jeroo is exploring the outer perimeter of the lake. It starts next to a flower and travels the entire way around the lake. Have your jeroo stop immediately before the flower (using a loop) and then, after the loop is over, your jeroo should pick the flower.
Download the maps
Map #1 : rectangular-lake.jev |
 |
 |
recangular-lake-if2.jev |
|
 |
|
|
 |
rectangular-lake-bumps1.jev |
|
 |
Remember Nets kill Jeroosrectangular-lake-bumps2.jev |
|
 |
Write a loop that makes the jeroo travel around the lake below. This loop should never end. walk-the-lake-jacks-map.jev |