8758
TOPICS
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Towers of Hanoi
The towers of Hanoi starts with a stack of disks on the left stick. You can move a disk to an empty stick or on top of a larger disk. The problem is to move all the disks to the right stick.
Contributed by:
Jay Warendorff
Based on a program by:
Jaime Rangel-Mondragón
SNAPSHOTS
RELATED LINKS
Tower of Hanoi
(
Wolfram
MathWorld
)
Generalized Hanoi Tower
(
Wolfram Library Archive
)
PERMANENT CITATION
"
Towers of Hanoi
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/TowersOfHanoi/
Contributed by:
Jay Warendorff
Based on a program by:
Jaime Rangel-Mondragón
Share:
Embed Interactive Demonstration
New!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
Picture Puzzle
Yu-Sung Chang
The Knight's Tour
Jay Warendorff
Picking Up Coins in a Grid
Heikki Ruskeepää
Slider Puzzle
Jon McLoone
Sudoku Game
Bruce Torrence
Color Cube 3x3x3 Puzzle
Abby Brown
Color Cube 2x2x2 Puzzle
Abby Brown
Lights Out Puzzle
Michael Schreiber
Stapler Puzzle
Karl Scherer
Eller Puzzle
Karl Scherer
Related Topics
Puzzles
Recreation
Recursion
High School Computer Science
High School Finite Mathematics
High School Mathematics
Puzzles and Recreations: Intermediate
School Puzzles and Recreations
Browse all topics
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+