The street grid has several diagonal streets. Your challenge in this activity is to create a program that will guide the RAV along the light blue triangular path: first along the bottom of the street grid, from the left to the right (3 full street blocks), then up along the right side street (3 more street blocks), and then down the diagonal street back to its starting point. Note that the triangle that is traced out is a right triangle with two equal sides (each 18 units long). You will therefore need to use the Pythagorean theorem to calculate the length of the hypotenuse (the diagonal) that the RAV will need to travel. You can use a calculator or the square root code block (click the "Math" button in the blocks section) to do the calculation.
|
Grid Size: S M L | Simple View: | MinView: |
Coord: x-axis y-axis | Grid Lines: x-axis y-axis | |||
Grid: | 12x12 inches | 24x24 inches | 36x36 inches | |
72x72 inches | 96x96 inches | 192x192 inches | ||
1x1 inches | 2x2 inches | Fraction: | ||
xy-Range: | ||||
|
||||
|
||||
Quad: | 1 Quadrant | 4 Quadrants | 1&4 Quadrants | |
Units: | US Customary | Metric | Ruler: |
Labels: |
|
|
|
Font
px
|
|
Tics Lines: |
|
Width
px
|
Hash Lines: |
|
Width
px
|
(
,
in
) in
|
|
degrees
|
|
(
,
in
) in
|
|
degrees
|
|
(
,
in
) in
|
|
degrees
|
|
(
,
in
) in
|
|
degrees
|
|
(
,
in
) in
|
|
degrees
|
|
(
,
in
) in
|
|
degrees
|
|
(
,
in
) in
|
|
degrees
|
|
(
,
in
) in
|
|
degrees
|
|
(
,
in
) in
|
|
degrees
|
|
(
,
in
) in
|
|
degrees
|
|
(
,
in
) in
|
|
degrees
|
|
(
,
in
) in
|
|
degrees
|
|
(
,
in
) in
|
|
degrees
|
|
(
,
in
) in
|
|
degrees
|
|
(
,
in
) in
|
|
degrees
|
|
(
,
in
) in
|
|
degrees
|
|
(
,
in
) in
|
|
degrees
|
|
(
,
in
) in
|
|
degrees
|
|
|
Add driveDistance and turn code blocks to enable the RAV to traverse a big triangle, as shown in red (three street blocks on the bottom, three street blocks on the right side, and then down the diagonal back to the starting position). |
|
|
|||||||||||
|
|||||||||||