You may also like

problem icon

Teddy Town

There are nine teddies in Teddy Town - three red, three blue and three yellow. There are also nine houses, three of each colour. Can you put them on the map of Teddy Town according to the rules?

problem icon

Instant Insanity

Given the nets of 4 cubes with the faces coloured in 4 colours, build a tower so that on each vertical wall no colour is repeated, that is all 4 colours appear.

problem icon

Nine Colours

You have 27 small cubes, 3 each of nine colours. Use the small cubes to make a 3 by 3 by 3 cube so that each face of the bigger cube contains one of every colour.

Conway's Chequerboard Army

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Duncan from Warden Park School, Zach from Rosemellin School and Stephen all got the minimal method for achieving both targets $C$. Stephen explains his method for $C$:

Position five counters in the row under $A$ (row $1$), with the middle counter directly under $A$. Then place three counters in the row below that (row $2$), with the left most directly under $A$.
Two under $A$ jumps one under $A$, so there is a counter on $A$. Then the counter two to the right of $A$ jumps to be directly under $A$ in row $1$. Then this counter jumps the one on $A$ so it sites on $B$.
The counter in row $1$ two to the left of $A$ jumps to directly under $A$, and the counter in row $2$ two the the right of $A$ jumps to be directly under $A$ in row $2$. Then this counter jumps the one above to land on $A$ then jumps the next to land on $C$.

Although all of you also found a method for finding $d$, you did not find the minimal method, so using the least possible counters and moves. Andy from the Garden International School explains the minimal way of achieving the target $D$.


$6c -> 4c$
$5e -> 5c -> 3c$
$5a -> 5c$
$6a -> 6c -> 4c -> 2c$
$6e -> 6c$
$7c -> 5c$
$7a -> 7c$
$8c -> 6c -> 4c$
$7e -> 7c$
$8e -> 8c -> 6c$
$8a -> 8c$
$9c -> 7c -> 5c -> 3c -> 1c$

Andy goes on to explain why you cannot achieve further than $D$ on the grid provided.

With the counters above needed to reach $D$, then we are left with:

Which you cannot reach beyond $D$ as you would need to get counters on $D$, $B$, and below $A$. Though there is a counter on $D$ which isn't in my picture. This cannot be made.

Congratulations to Andy, can you think of another way of reaching $D$?