Question 8
In a computer game, a maze is illustrated as a grid, where some cells are painted in grey. The grey cells indicate where traps have been placed and the white cells indicate safe cells. A jumping man named Jay is standing on a white cell, which is indicated as “J”. Jay may jump from one white cell to another white cell. However, he may only jump horizontally or vertically at most 3 cells. He can jump over a sequence of grey cells, but he cannot jump over another white cell (and he cannot land on a grey cell).
For example, as shown below, if Jay stands on “J”, he may jump three cells to the right or two cells down, but he cannot jump four cells to the left or three cells down. To get to any other white cell, he would need additional jumps.
In the following maze, Jay begins on “J”. What is the minimum number of jumps he needs to do to be sure that any other white cell can be reached when jumping from this starting position?
For example, as shown below, if Jay stands on “J”, he may jump three cells to the right or two cells down, but he cannot jump four cells to the left or three cells down. To get to any other white cell, he would need additional jumps.
In the following maze, Jay begins on “J”. What is the minimum number of jumps he needs to do to be sure that any other white cell can be reached when jumping from this starting position?