Moves
0
Target
0
Click a frog to move it into the empty space.
Configuration
Campaign Mode
Start with 1 frog and progress through levels.
Colors
Session History
| Left | Right | Moves | Target | Sequence | Verdict |
|---|---|---|---|---|---|
| Complete the puzzle to see your stats here. | |||||
Teacher's Note: The Pattern
The minimum number of moves follows a quadratic sequence. If there are n frogs on one side and m on the other, the total moves required is n × m + n + m.
Show Algorithm Hint
To solve efficiently, try to avoid putting two frogs of the same color next to each other (unless they are at the end of their journey).
Alternate moves: Slide (S), Jump (J), Slide (S), Jump (J)...
Key: S = Slide (1 space), J = Jump (2 spaces)