You may also like

problem icon

Just Rolling Round

P is a point on the circumference of a circle radius r which rolls, without slipping, inside a circle of radius 2r. What is the locus of P?

problem icon

Coke Machine

The coke machine in college takes 50 pence pieces. It also takes a certain foreign coin of traditional design. Coins inserted into the machine slide down a chute into the machine and a drink is duly released. How many more revolutions does the foreign coin make over the 50 pence piece going down the chute? N.B. A 50 pence piece is a 7 sided polygon ABCDEFG with rounded edges, obtained by replacing AB with arc centred at E and radius EA; replacing BC with arc centred at F radius FB ...etc..

problem icon

Rotating Triangle

What happens to the perimeter of triangle ABC as the two smaller circles change size and roll around inside the bigger circle?

Changing Places

Stage: 4 Challenge Level: Challenge Level:1

A four by four square grid contains fifteen counters with the bottom left hand square empty. The counter in the top right hand square is red and the rest are blue. The aim is to slide the red counter from its starting position to the bottom left hand corner in the least number of moves. You may only slide a counter into an empty square by moving it up, down, left or right but not diagonally.
Explore a four by four array. You may like to use the interactvity to help you before trying the questions below.

Full Screen View
This text is usually replaced by the Flash movie.


How many moves did you take to move the red counter to HOME (pink square)?


Can you do it in fewer moves?
What is the least number of moves you can do it in?


Try a smaller array.
How many moves did you take to move the red counter to HOME?
Try a larger array.
What is the least number of moves you can do it in?


Have you a strategy for moving down each array?


On which move does the red counter make its first move?
On which moves does the red counter make its other moves?
Can you predict the number of moves that the red counter makes on the way HOME?
Why is the least number of moves ALWAYS odd?
Can you predict what the least number of moves will be for any square array?


Can you explain why YOUR rule works?



You can take this further by considering similar ideas using rectangular arrays or in three dimensions.