Digital Repository at the University of Maryland (DRUM)  >
Theses and Dissertations from UMD  >
UMD Theses and Dissertations 

Please use this identifier to cite or link to this item: http://hdl.handle.net/1903/1527

Title: On the Generalized Tower of Hanoi Problem I: An Introduction to Cluster Spaces
Authors: Rukhin, Andrey
Advisors: Gasarch, William
Department/Program: Applied Mathematics and Scientific Computation
Type: Thesis
Subjects: Mathematics
Keywords: Tower of Hanoi
Combinatorics
Cluster Spaces
Clusters
Issue Date: 4-May-2004
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.
URI: http://hdl.handle.net/1903/1527
Appears in Collections:UMD Theses and Dissertations
Computer Science Theses and Dissertations
Mathematics Theses and Dissertations

Files in This Item:

File Description SizeFormatNo. of Downloads
umi-umd-1510.pdf653.46 kBAdobe PDF815View/Open

All items in DRUM are protected by copyright, with all rights reserved.

 

DRUM is brought to you by the University of Maryland Libraries
University of Maryland, College Park, MD 20742-7011 (301)314-1328.
Please send us your comments