Avoiding an obstacle: count paths through checkpoints
Use step-by-step path counting to find routes that move only right or up while avoiding a blocked grid point.
The video could not load. Check your connection and try again, or download it directly.
Download video
Open Chinese transcript
- 从左下到右上要走两次右、两次上;先看没有障碍时,共有6种不同次序。
- 中央点不能经过。到中央要走一次右和一次上,顺序有2种。
- 从中央离开到终点,也是一右一上,仍有2种次序。
- 所以经过中央的路线有2乘2等于4条,这4条都要删除。
- 用总数6减去4,剩2条;直接列出是右右上上与上上右右。
- 两条都沿外边绕开中央。分点累计时,方向和禁点条件不能改变。
Sources for this explanation
Logical thinking
Count all six shortest routes, then remove the four that pass through the central point.
Worked example
On a 2-by-2 step grid, move from the bottom left to the top right using only right or up. The central point is blocked. How many routes remain?
There are 2 routes. Of the 6 shortest routes, 4 pass through the blocked centre, so 6 minus 4 leaves 2.
Try one question
There are six orders of two R and two U moves.