Jack starts in the small square shown shaded on the grid, and makes a sequence of moves. Each move is to a neighbouring small square, where two small squares are neighbouring if they have an edge in common. He may visit a square more than once. Jack makes four moves. In how many different small squares could Jack finish?
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
