The Tower of Hanoi – Myths and Maths

Voorkant
Birkhäuser, 17 apr 2018 - 452 pagina's

The solitaire game “The Tower of Hanoi" was invented in the 19th century by the French number theorist Édouard Lucas. The book presents its mathematical theory and offers a survey of the historical development from predecessors up to recent research. In addition to long-standing myths, it provides a detailed overview of the essential mathematical facts with complete proofs, and also includes unpublished material, e.g., on some captivating integer sequences. The main objects of research today are the so-called Hanoi graphs and the related Sierpiński graphs. Acknowledging the great popularity of the topic in computer science, algorithms, together with their correctness proofs, form an essential part of the book. In view of the most important practical applications, namely in physics, network theory and cognitive (neuro)psychology, the book also addresses other structures related to the Tower of Hanoi and its variants.

The updated second edition includes, for the first time in English, the breakthrough reached with the solution of the “The Reve's Puzzle" in 2014. This is a special case of the famed Frame-Stewart conjecture which is still open after more than 75 years. Enriched with elaborate illustrations, connections to other puzzles and challenges for the reader in the form of (solved) exercises as well as problems for further exploration, this book is enjoyable reading for students, educators, game enthusiasts and researchers alike.

Excerpts from reviews of the first edition:

“The book is an unusual, but very welcome, form of mathematical writing: recreational mathematics taken seriously and serious mathematics treated historically. I don’t hesitate to recommend this book to students, professional research mathematicians, teachers, and to readers of popular mathematics who enjoy more technical expository detail.”

Chris Sangwin, The Mathematical Intelligencer 37(4) (2015) 87f.

“The book demonstrates that the Tower of Hanoi has a very rich mathematical structure, and as soon as we tweak the parameters we surprisingly quickly find ourselves in the realm of open problems.”

László Kozma, ACM SIGACT News 45(3) (2014) 34ff.

“Each time I open the book I discover a renewed interest in the Tower of Hanoi. I am sure that this will be the case for all readers.”

Jean-Paul Allouche, Newsletter of the European Mathematical Society 93 (2014) 56.

 

Geselecteerde pagina's

Inhoudsopgave

Chapter 0 The Beginning of the World
1
Chapter 1 The Chinese Rings
71
Chapter 2 The Classical Tower of Hanoi
92
Chapter 3 Lucass Second Problem
165
Chapter 4 Sierpiński Graphs
175
Chapter 5 The Tower of Hanoi with More Pegs
207
Chapter 6 Variations of the Puzzle
283
Chapter 7 The Tower of London
301
Chapter 9 Hints Solutions and Supplements to Exercises
355
Chapter 10 The End of the World
401
Glossary
405
Bibliography
409
Name Index
437
Subject Index
441
Symbol Index
454
Copyright

Chapter 8 Tower of Hanoi Variants with Restricted Disc Moves
314

Overige edities - Alles bekijken

The Tower of Hanoi – Myths and Maths
Andreas M. Hinz,Sandi Klavžar,Ciril Petr
Geen voorbeeld beschikbaar - 2018
The Tower of Hanoi – Myths and Maths
Andreas M. Hinz,Sandi Klavžar,Ciril Petr
Geen voorbeeld beschikbaar - 2018

Veelvoorkomende woorden en zinsdelen

algorithm automaton auxiliary peg bijection binary called Chapter Chinese rings colors complete graph conjecture Corollary corresponding d(is define denoted digraph disc moves distance Dudeney edge Édouard Lucas equivalence Exercise Figure finite formula Frame-Stewart goal peg graph G Gray code hamiltonian cycle hamiltonian path Handshaking Lemma Hanoi graphs Hinz idle peg induction assumption isomorphic largest disc LDMs Lemma Lucas mathematical minimum number move disc move of disc namely number of discs number of moves obtained optimal path optimal solution Parameter path graph perfect code permutation planar problem proof Proposition proved recurrence respectively Section shortest path Sierpiński curve Sierpiński graphs Sierpiński triangle smallest discs sn+1 solve source peg square-free sequence Stockmeyer subgraph subtower task Theorem three pegs Tower of Antwerpen Tower of Hanoi transfer triangle unique variant vertices

Over de auteur (2018)

Andreas M. Hinz is Professor at the Department of Mathematics, University of Munich (LMU), Germany. He has worked at the University of Geneva (Switzerland), King's College London (England), the Technical University of Munich (Germany), and the Open University in Hagen (Germany). His main fields of research are real analysis, the history of science, mathematical modeling, and discrete mathematics.

Sandi Klavžar is Professor at the Faculty of Mathematics and Physics, University of Ljubljana, Slovenia, and at the Department of Mathematics and Computer Science, University of Maribor, Slovenia. He is an author of three books on graph theory and an editorial board member of numerous journals including Discrete Applied Mathematics, European Journal of Combinatorics, and MATCH Communications in Mathematical and in Computer Chemistry.

Ciril Petr is a researcher at the Faculty of Natural Sciences and Mathematics, University of Maribor, Slovenia.

Bibliografische gegevens

TitelThe Tower of Hanoi – Myths and Maths
AuteursAndreas M. Hinz, Sandi Klavžar, Ciril Petr
Editie2
UitgeverBirkhäuser, 2018
ISBN3319737791, 9783319737799
Lengte452 pagina's
  
Citatie exporterenBiBTeX EndNote RefMan