OR/MS Games: 2. Towers of Hanoi

Moshe Sniedovich - m.sniedovich@ms.unimelb.edu.au
Department of Mathematics and Statistics, The University of Melbourne, Parkville, Victoria 3052, Australia

Abstract

In this discussion we examine the famous Towers of Hanoi puzzle from an OR/MS perspective, focusing on its educational content. We show that this puzzle provides an excellent environment for illustrating a number of fundamental OR/MS problem-solving concepts in general and dynamic programming concepts in particular. In addition to the popular 'min' version of the problem, we also present an interesting but rather neglected 'max' version. On-line interactive modules are included.

Download the PDF
10.1287/ited.3.1.45

Citation Information
Sniedovich, M. 2002. OR/MS Games: 2. Towers of Hanoi. INFORMS Trans. Ed. 3(1) 45-62. Available online at http://ite.pubs.informs.org/.

DOI: 10.1287/ited.3.1.45