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

dc.contributor.advisor	Gasarch, William	en_US
dc.contributor.author	Rukhin, Andrey	en_US
dc.contributor.department	Applied Mathematics and Scientific Computation	en_US
dc.date.accessioned	2004-06-04T06:00:04Z
dc.date.available	2004-06-04T06:00:04Z
dc.date.issued	2004-05-04	en_US
dc.description.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.	en_US
dc.format.extent	669140 bytes
dc.format.mimetype	application/pdf
dc.identifier.uri	http://hdl.handle.net/1903/1527
dc.language.iso	en_US
dc.relation.isAvailableAt	Digital Repository at the University of Maryland	en_US
dc.relation.isAvailableAt	University of Maryland (College Park, Md.)	en_US
dc.subject.pqcontrolled	Mathematics	en_US
dc.subject.pquncontrolled	Tower of Hanoi	en_US
dc.subject.pquncontrolled	Combinatorics	en_US
dc.subject.pquncontrolled	Cluster Spaces	en_US
dc.subject.pquncontrolled	Clusters	en_US
dc.title	On the Generalized Tower of Hanoi Problem I: An Introduction to Cluster Spaces	en_US
dc.type	Thesis	en_US

Files

Now showing 1 - 1 of 1