Snail Climbing A Tree
Challenge: A snail is on the ground and wishes to reach the top of a 1500 mm tall tree. It climbs 350 mm up each day and then slides 280 mm down during the night. The object of the activity is to create an algorithm to calculate the number of days required for the snail to reach the top of the tree and code the VR Robot to simulate the process of the snail climbing the tree.
- Choose and download the Snail Climbing A Tree background as a PNG file from this Google slideshow.
- Select the Art Canvas+ Playground and upload the Snail Climbing A Tree background.
- Create an algorithm to calculate the number of days required for the snail to reach the top of the tree and code the VR Robot to simulate the climbing process.
- Create variables to track the remaining tree height for the snail to climb and the number of days the snail takes.
- Code the VR Robot to move to the Start Position at the bottom of the tree.
- Drive the robot forward and reverse to simulate the snail’s climbing process during one day and night. Update the remaining tree height to climb and the number of days the snail takes. Repeat this process until the snail arrives at the top of the tree.
- Use the [print] block to print the variable value to the Print Console to report the number of days the snail takes to reach the top of the tree.
Helpful Hints
- If the remaining tree height for the snail to climb is equal to or less than 350 mm, the snail can reach the top of the tree within one day and will not slide down during the night.