Copyright © University of Cambridge. All rights reserved.
'Jumping Cricket' printed from https://nrich.maths.org/
Harry sent us his thoughts on this
problem:
My first way was that El Crico jumps along one tile, down three
tiles and along one tile.
Then I thought that there are six different ways El Crico starts
off his journey. He jumps along one, two or three tiles or he jumps
down one, two or three tiles. Then he has two moves to get to the
end. One of these jumps takes him to the very right of the board
and the other takes him to the very bottom.
I made a table of all the possible moves. There are twelve of
them.
First Move |
Second Move |
Third Move |
Along one |
Along two |
Down three |
Along one |
Down three |
Along two |
Along two |
Along one |
Down three |
Along two |
Down three |
Along one |
Along three |
Down one |
Down two |
Along three |
Down two |
Down one |
Down one |
Down two |
Along three |
Down one |
Along three |
Down two |
Down two |
Down one |
Along three |
Down two |
Along three |
Down one |
Down three |
Along one |
Along two |
Down three |
Along two |
Along one |
That's great, Harry. Thank you!