Solving the Tower of Hanoi Puzzle with Heavy Disks

The Tower of Hanoi puzzle, traditionally solved with light disks, presents unique challenges when using heavy disks. This study focuses on minimizing the total distance traveled by the disks during the solution process. The puzzle's rules allow flexibility in designating the starting and target...

Full description

Bibliographic Details

Published in:	The American mathematical monthly Vol. 132; no. 8; p. 806
Main Author:	Fried, Sela
Format:	Journal Article
Language:	English
Published:	Washington Taylor & Francis Ltd 14.09.2025
Subjects:	Disks Numbers Puzzles Recursive algorithms
ISSN:	0002-9890, 1930-0972
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!