Degree Name

MS (Master of Science)

Program

Mathematical Sciences

Date of Award

5-2015

Committee Chair or Co-Chairs

Robert A. Beeler

Committee Members

Teresa W. Haynes, Jeff R. Knisley, Anant P. Godbole

Abstract

The Apprentices' Tower of Hanoi is introduced in this thesis. Several bounds are found in regards to optimal algorithms which solve the puzzle. Graph theoretic properties of the associated state graphs are explored. A brief summary of other Tower of Hanoi variants is also presented.

Document Type

Thesis - Open Access

Copyright

Copyright by the authors.

Share

COinS