2018 Beaver Computing Challenge
(Grade 7 & 8)
Questions, Answers, Explanations, and Connections
Joni Beaver uses rope to mark groups of trees. The rope forms a very tight loop so that each tree either touches the rope or is entirely inside the loop. Below is an example where the rope touches exactly 5 trees when viewed from above.
How many trees will the rope touch if the trees are arranged as follows (when viewed from above)?
(C) 6
We can count the trees touching the rope in the picture below.
This problem is known as finding the convex hull of a set of points. One way to define this is the polygon with the smallest area which contains all the points in the set. The word convex means extending outward or curving out, and any two points within a convex shape, when drawn on paper, can be connected with a straight line which is inside of the shape. The word hull here is used to describe the “shell" or “encasement", as in the hull of a ship or the hull of a seed, such as corn.
Finding the convex hull of a set of points is very useful:
Canada
Beavers play a simple game. The game always begins with this starting position:
From this starting position, rotation instructions are followed. All the rotations are clockwise and one quarter of a complete turn. The possible instructions are:
For example, if the first instruction is 2R, the top-left square will be Yellow as shown below.
From the starting position, what colours will the top-left square be after each of the instructions 1R, 2R, 2R, and 3R are followed in order?
(B) Red Blue Green Blue Red
The top-left square is Red for the starting position and the results after each rotation are shown below.
This problem involves following a series of steps and keeping track of the current state. The state could be what the current orientation looks like, or only what is in the top-left corner (which can be used to determine the position of the other three colours). The ordered sequence of instructions is an algorithm. The ability to execute algorithms and remember state is the defining property of a computer.
This problem also involves simplifying and applying reasoning, since a rotation by two 2R rotations, or 1R plus 3R rotations (for a total of 4R rotations) will yield the game in the same orientation as it started.
Canada
Beaver graffiti consists of three different symbols: ,
, and
.
Sequences of symbols are built using two steps:
Step 1 happens first and exactly one time. Step 2 may happen any number of times. Here are five examples:
Which of the following is not an example of beaver graffiti?