On the Generalized Tower of Hanoi Problem I: An Introduction to Cluster Spaces
On the Generalized Tower of Hanoi Problem I: An Introduction to Cluster Spaces
Loading...
Files
Publication or External Link
Date
2004-05-04
Authors
Rukhin, Andrey
Advisor
Gasarch, William
Citation
DRUM DOI
Abstract
In this thesis, we examine the Tower of Hanoi puzzle with p posts (p >= 3) and n disks (n in N). We examine the puzzle in the context of a cluster space: a hierarchical partitioning of the space of all possible disk configurations. This thesis includes two theorems that address the topic of minimal paths connecting disk configurations.