Page 89 - NUMINO Challenge_C2
P. 89
10 Number of Shortest Paths
Basic Concepts Number of Shortest Paths in 2-D Shapes
As shown below, the number of shortest paths from A to B can be found
by adding the number of paths to each point.
1 2B 1 2 3B 1 3 6B
A1 A 11 12 3
2 paths
3 paths A 11
6 paths
When there are diagonals, the path from A to B gets shorter as more
diagonals are passed.
BBB
AAA
Example Find the number of shortest paths from Hospital
the house to the hospital.
House
Class Notes
To go fr om the house to the hospital Hospital
using the shortest path, you must pass
through two diagonal lines: and .
You must not pass through diagonal line
because it goes in the opposite 22
direction of the hospital. 1 2
Find the number of shortest paths from
the house to the hospital passing through
the two diagonal lines found in . Fill in House 1
the blanks with the number of shortest
paths. Therefore, the number of shortest paths from the house to the hospital is .
86 NUMINO Challenge C2
Basic Concepts Number of Shortest Paths in 2-D Shapes
As shown below, the number of shortest paths from A to B can be found
by adding the number of paths to each point.
1 2B 1 2 3B 1 3 6B
A1 A 11 12 3
2 paths
3 paths A 11
6 paths
When there are diagonals, the path from A to B gets shorter as more
diagonals are passed.
BBB
AAA
Example Find the number of shortest paths from Hospital
the house to the hospital.
House
Class Notes
To go fr om the house to the hospital Hospital
using the shortest path, you must pass
through two diagonal lines: and .
You must not pass through diagonal line
because it goes in the opposite 22
direction of the hospital. 1 2
Find the number of shortest paths from
the house to the hospital passing through
the two diagonal lines found in . Fill in House 1
the blanks with the number of shortest
paths. Therefore, the number of shortest paths from the house to the hospital is .
86 NUMINO Challenge C2
