ScratchData LogoScratchData
Back to abhayjoshi's profile

Tower of Hanoi - final

ABabhayjoshi•Created November 8, 2015
Tower of Hanoi - final
10
8
638 views
View on Scratch

Instructions

1. Click the “Green flag”: a help screen appears. Read the instructions carefully. 2. Click anywhere to continue. 3. Using the "Disks" slider pick the number of disks: 1 to 5. 4. Click "Setup" to arrange the disks on one of the rods. 5. Press SPACE BAR to move the disks yourself, one disk at a time.

Description

The Tower of Hanoi is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: 1. Only one disk can be moved at a time. 2. A disk can only be moved if it is the uppermost disk on a stack. 3. You cannot place a bigger disk on top of a smaller disk.

Project Details

Project ID87006602
CreatedNovember 8, 2015
Last ModifiedApril 15, 2023
SharedNovember 8, 2015
Visibilityvisible
CommentsAllowed