Lucas’s Second Problem

Andreas M. Hinz (), Sandi Klavžar (), Uroš Milutinović () and Ciril Petr ()
Additional contact information
Andreas M. Hinz: LMU München, Faculty of Mathematics, Computer Science and Statistics, Institut für Mathematik
Sandi Klavžar: University of Ljubljana, Faculty of Mathematics and Physics
Uroš Milutinović: University of Maribor, Faculty of Natural Sciences and Mathematics
Ciril Petr: University of Maribor, Faculty of Natural Sciences and Mathematics

Chapter Chapter 4 in The Tower of Hanoi – Myths and Maths, 2013, pp 131-140 from Springer

Abstract: Abstract In his early descriptions of the TH, Lucas pointed out the possibility of starting with an arbitrary distribution of nψ discs among three pegs, i.e. allowing for discs lying on a smaller one. The task is again to arrive at a perfect state on a preassigned peg, while still obeying the divine rule. This, in Lucas’s opinion, will vary the conditions of the problem of the TH “to infinity”. We may even go beyond by prescribing an arbitrary, albeit regular, state as the goal. We will approach this problem in the next section and round this chapter off with a section on an algorithmic solution to Lucas’s second problem.

Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-0348-0237-6_4

Ordering information: This item can be ordered from
http://www.springer.com/9783034802376

DOI: 10.1007/978-3-0348-0237-6_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().