|
|
|
|
|
|
|
|
|
|
||
|
|
||
Describe how you can predict the minimum number of moves from
the number of pairings?
*For rules and details, see the Traffic
Jam Activity. There you will find a Java Applet to do this puzzle.
Also see Playing
with Frogs - a variation of the
theme.