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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer Basel
About this chapter
Cite this chapter
Hinz, A.M., Klavžar, S., Milutinović, U., Petr, C. (2013). Lucas’s Second Problem. In: The Tower of Hanoi – Myths and Maths. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-0237-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-0348-0237-6_4
Published:
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-0236-9
Online ISBN: 978-3-0348-0237-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)