Copyright © University of Cambridge. All rights reserved.

## 'Frogs' printed from http://nrich.maths.org/

Watch the video below.

*If you can't see the video, reveal the hidden text which describes the video*
Imagine two red frogs and two blue frogs sitting on lily pads, with a spare lily pad in between them.
Frogs can slide onto adjacent lily pads or jump over a frog; frogs can't jump over more than one frog.

**Can we swap the red frogs with the blue frogs?**
Experiment with different numbers of red and blue frogs.

Can you always swap the frogs over without having to move any frogs backwards?

Can you predict how many moves it will take you?

Can you swap the frogs over when the number of red and blue frogs is not the same?

Can you predict how many moves it will take you?

You can use the interactive environment below or explore with counters.

Full Screen and tablet version
Can you see any patterns in the sequence of moves that it takes to swap the frogs over?

Can you explain why those patterns occur?

**Can you describe a method for swapping all the frogs over in the minimum number of moves?**
Printable

NRICH Roadshow resource.

*If the interactivity above does not work, you could try this older Flash version instead.*