Computer Science
Sport & Fun


This problem known as Fort Knox Jumping Frogs is to make four piles of two tiles in four moves. Each move consists of taking one tile and moving it left or right by skipping two tiles and piling it on top of the third tile. Of course, a pile of two counts for two tiles.

Click on < and > buttons to move the above tile to the left and right.



The idea of this puzzle is from the book 'Hard-toSolveBrainteasers' by Jaime and Lea Poniachik. Sterling Publishing, New York.

Click here to return to the puzzle page

HTML/JavaScript: Copyright (c) 2004 Timothy Sakharov, Alexander Sakharov