<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

On the Generalized Tower of Hanoi Problem I: An Introduction to Cluster Spaces

Loading...
Thumbnail Image

Files

umi-umd-1510.pdf (653.46 KB)
No. of downloads: 2299

Publication or External Link

External Link to Data Files

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.

Notes

Rights

Endorsement

Review

Supplemented By

Referenced By