List shortest routes with arrows
Represent grid paths as right/down sequences to avoid omissions and duplicates.
The video could not load. Check your connection and try again, or download it directly.
Download video
Open Chinese transcript
- 在这张方格地图里,从左上走到右下。每条小边一样长,只能沿格线走,不能斜穿。最短路线有几条?
- 要到终点,必须向右两次,向下两次。这四步刚好到达。往回走,就会多出路程,不能算最短。
- 用右和下的箭头记路线。先向右的有三条:右右下下,右下右下,右下下右。
- 先向下也有三条:下右右下,下右下右,下下右右。每条都恰好有两个右,两个下。
- 四步的位置,一旦选好两步向右,其余两步就向下。六种排列都列出了,所以共有六条最短路线。
- 这里数的是这张方格图。如果加上障碍,或允许斜走,路线就要重新检查。不能把六条,当成所有地图的答案。
Sources for this explanation
Logical thinking
On a 2×2 grid of equal edges, a shortest path uses four edges: two right and two down. Group sequences by their first move.
Worked example
On an unobstructed 2×2 grid, follow equal-length grid edges from top left to bottom right, without diagonals. How many shortest routes exist?
RRDD, RDRD, RDDR, DRRD, DRDR and DDRR: six routes.
Try one question
Three start right and three start down; all contain exactly two of each move.