Skip to content

sjdatascientist/frog-leap-game

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 

Repository files navigation

FROG LEAP GAME

The objective of the puzzle is to switch the positions of all the colored frogs, so that all three brown frogs are on the right and all three green frogs are on the left. When all the frogs have reached the other side of the pond, you win!

Choose a frog to make it jump forward or backward. A frog can jump a maximum of two spaces, and the destination spot must be free.

Brwon frogs can only hop to the right. Green frogs can only hop to the left. Frogs can only jump onto an empty rock. A frog can jump over one frog to an empty rock—but only over one.

Frogs cannot jump back, only forward. It’s easy to tell which way they can go—they face the way they want to jump.

If you get stuck and your frogs can't jump anywhere, restart the code to reset the game.

Website for game reference:

https://www.neok12.com/games/leap-froggies/leap-froggies.htm

INSTRUCTIONS HOW TO PLAY:

  1. Select the frog using just as like list indexing options ranging 0 to 6 where 0 is the first position and 6 is the last to hop the fog based on some conditions.
  2. The 'B' represents brown frog, 'G' represents green frog and '_' represents vacant stone.
  3. A frog can jump over only one frog(any color) at a time, or just jump to a nearby vacant rock.
  4. Move all the brown frogs to the right and green frogs to the left to solve the game puzzle.

SOLUTION: If You Get Stuck

4 2 1 3 5 6 4 2 0 1 3 5 4 2 3

Press these numbers in series as asked at the input time from user.

About

PrepInsta Data Analysis Internship - Project 2

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published