Babylon

Home
Home / Puzzles in Education / Hands On Puzzles / Grade 7-8 /

This puzzle is a variation of the classic Tower of Hanoi. You can play it on several different levels of difficulty and with variant sets of rules.

The puzzle begins with a stack of disks in the left hand column as shown in the insets below. Your object in each puzzle is to transfer the disks to the right-hand column, keeping the same numerical order.

The basic rule is do not place a disk on another disk of smaller value. Otherwise, shuttle the disks one at a time among the three columns until you have the proper arrangement in the right-hand column.

Puzzles 1, 2, 3 and 4 (see first diagram below, left) find the minimum number of moves to transfer 2, 3, 4 and 5 disks respectively to the right-hand column.

Puzzle 5 (second diagram below) find the minimum number of moves to transfer the four disks, observing an additional rule that a disk can not be placed on another disk of the same color. That means that disk 1 cannot be placed on disk 4.

Posted: December 11, 2007
Puzzle
Solution
PDF Version (82 KB)

Step Through:

How Many Squares? Babylon II
< Previous Next >
Discover More

 
< Home   |   Our Privacy Policy   |   About Puzzles.COM   |   Link to Us   |   Contact Us
Copyright 2007 ThinkFun Inc. All Rights Reserved.
ThinkFun - Everybody plays.