The Open UniversitySkip to content
 

Hanoi revisited

Forbes, Tamsin and Forbes, Tony (2016). Hanoi revisited. The Mathematical Gazette, 100(549) pp. 435–441.

DOI (Digital Object Identifier) Link: https://doi.org/10.1017/mag.2016.108
Google Scholar: Look up in Google Scholar

Abstract

We consider a simple extension of the familiar Tower of Hanoi puzzle. There are three vertical pegs lined up in a row and n discs. The discs have holes in their centres so that they can be threaded on to the pegs. Initially, all n discs are placed on the left-hand peg in non-increasing order of radius to form a tower, as in Figure 1. The object of the game is to transfer the entire tower to the right-hand peg by moving discs from peg to peg, one at a time according to the rules:

(1) only a disc at the top of a tower may be moved;

(2) a disc must never be placed on top of a smaller disc.

Item Type: Journal Item
ISSN: 0025-5572
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Item ID: 56579
Depositing User: Anthony Forbes
Date Deposited: 01 Oct 2018 12:52
Last Modified: 07 Dec 2018 11:11
URI: http://oro.open.ac.uk/id/eprint/56579
Share this page:

Metrics

Altmetrics from Altmetric

Citations from Dimensions

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU