Rank: Advanced Member
Groups: Campaign Member
, Moderator, Registered
Joined: 3/16/2009
Posts: 60
Location: Reading
|
The Morning Ride today organised by Reading CTC visited the Herb Farm in Sonning Common (Grid Reference SU711797 for those who don't know it).
In the garden, there's a grid game, as shown in the picture below:
Note: the numbers at the extreme left and right of the first row are 4 and 2 respectively
These are the rules of the game (my summary):
- The starting point is the black "1" square in the bottom row [Coordinate (3,1)].
- The objective is to get to the chequered square at the centre of the board [(Coordinate (3,3)].
- You move the number of squares given by the square on which you're currently positioned. (So the first move is always by one square.)
- Diagonal moves are not allowed: moves are left, right, forwards or backwards (as viewed from the perspective of the photograph) and the entire move must be in a single direction for the full number of squares indicated.
Who can find a solution to the game in the smallest number of moves?
For clarity, I suggest moves are specified using this convention:
- Move number, followed by a dot and white space (the first move is move number 1, so this would be 1. )
- The number on the square to which you're moving, followed by white space.
- The (x,y) coordinate of the square to which you're moving (ie, column number and row number separated by a comma and enclosed in brackets).
So, for example, from the starting position on the "1" square at (3,1) and making a first move left to the red square with a "2" on it, and then a move to the similar square two places forwards, the moves would be shown as:
1. 2 (2,1)
2. 2 (2,3)
The last move gets you to the square with no number (so use white space) at coordinate (3,3).
My own solution requires 11 moves. Can you do it in fewer?
Stephen
|
