The Tower Of Hanoi – Myths And Maths
   HOME

TheInfoList



OR:

''The Tower of Hanoi – Myths and Maths'' is a book in
recreational mathematics Recreational mathematics is mathematics carried out for recreation (entertainment) rather than as a strictly research and application-based professional activity or as a part of a student's formal education. Although it is not necessarily limited ...
, on the
tower of Hanoi The Tower of Hanoi (also called The problem of Benares Temple or Tower of Brahma or Lucas' Tower and sometimes pluralized as Towers, or simply pyramid puzzle) is a mathematical game or puzzle consisting of three rods and a number of disks of va ...
,
baguenaudier Baguenaudier (; French for "time-waster"), also known as the Chinese rings, Cardan's suspension, Cardano's rings, Devil's needle or five pillars puzzle, is a disentanglement puzzle featuring a loop which must be disentangled from a sequence of ...
, and related puzzles. It was written by Andreas M. Hinz,
Sandi Klavžar Sandi Klavžar (born 5 February 1962) is a Slovenian mathematician working in the area of graph theory and its applications. He is a professor of mathematics at the University of Ljubljana. Education Klavžar received his Ph.D. from the University ...
, Uroš Milutinović, and Ciril Petr, and published in 2013 by
Birkhäuser Birkhäuser was a Swiss publisher founded in 1879 by Emil Birkhäuser. It was acquired by Springer Science+Business Media in 1985. Today it is an imprint used by two companies in unrelated fields: * Springer continues to publish science (particu ...
, with an expanded second edition in 2018. The Basic Library List Committee of the
Mathematical Association of America The Mathematical Association of America (MAA) is a professional society that focuses on mathematics accessible at the undergraduate level. Members include university, college, and high school teachers; graduate and undergraduate students; pure a ...
has suggested its inclusion in undergraduate mathematics libraries.


Topics

Although this book is in
recreational mathematics Recreational mathematics is mathematics carried out for recreation (entertainment) rather than as a strictly research and application-based professional activity or as a part of a student's formal education. Although it is not necessarily limited ...
, it takes its subject seriously, and brings in material from
automata theory Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science. The word ''automata'' comes from the Greek word αὐτόματο ...
,
computational complexity In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) ...
, the design and analysis of
algorithm In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific Computational problem, problems or to perform a computation. Algorithms are used as specificat ...
s,
graph theory In mathematics, graph theory is the study of ''graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are conne ...
, and
group theory In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field ...
,
topology In mathematics, topology (from the Greek language, Greek words , and ) is concerned with the properties of a mathematical object, geometric object that are preserved under Continuous function, continuous Deformation theory, deformations, such ...
,
fractal geometry In mathematics, a fractal is a geometric shape containing detailed structure at arbitrarily small scales, usually having a fractal dimension strictly exceeding the topological dimension. Many fractals appear similar at various scales, as illus ...
,
chemical graph theory Chemical graph theory is the topology branch of mathematical chemistry which applies graph theory to mathematical modelling of chemical phenomena. The pioneers of chemical graph theory are Alexandru Balaban, Ante Graovac, Iván Gutman, Haruo Hosoy ...
, and even
psychology Psychology is the scientific study of mind and behavior. Psychology includes the study of conscious and unconscious phenomena, including feelings and thoughts. It is an academic discipline of immense scope, crossing the boundaries betwe ...
(where related puzzles have applications in
psychological testing Psychological testing is the administration of psychological tests. Psychological tests are administered by trained evaluators. A person's responses are evaluated according to carefully prescribed guidelines. Scores are thought to reflect individ ...
). The 1st edition of the book had 10 chapters, and the 2nd edition has 11. In both cases they begin with chapter zero, on the background and history of the
Tower of Hanoi The Tower of Hanoi (also called The problem of Benares Temple or Tower of Brahma or Lucas' Tower and sometimes pluralized as Towers, or simply pyramid puzzle) is a mathematical game or puzzle consisting of three rods and a number of disks of va ...
puzzle, covering its real-world invention by
Édouard Lucas __NOTOC__ François Édouard Anatole Lucas (; 4 April 1842 – 3 October 1891) was a French mathematician. Lucas is known for his study of the Fibonacci sequence. The related Lucas sequences and Lucas numbers are named after him. Biography Lucas ...
and in the mythical backstory he invented for it. Chapter one considers the
Baguenaudier Baguenaudier (; French for "time-waster"), also known as the Chinese rings, Cardan's suspension, Cardano's rings, Devil's needle or five pillars puzzle, is a disentanglement puzzle featuring a loop which must be disentangled from a sequence of ...
puzzle (or, as it is often called, the Chinese rings), related to the tower of Hanoi both in the structure of its
state space A state space is the set of all possible configurations of a system. It is a useful abstraction for reasoning about the behavior of a given system and is widely used in the fields of artificial intelligence and game theory. For instance, the toy ...
and in the fact that it takes an
exponential Exponential may refer to any of several mathematical topics related to exponentiation, including: *Exponential function, also: **Matrix exponential, the matrix analogue to the above * Exponential decay, decrease at a rate proportional to value *Exp ...
number of moves to solve, and likely the inspiration for Lucas. Chapter two introduces the main topic of the book, the tower of Hanoi, in its classical form in which one must move disks one-by-one between three towers, always keeping the disks on each tower sorted by size. It provides several different
algorithm In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific Computational problem, problems or to perform a computation. Algorithms are used as specificat ...
s for solving the classical puzzle (in which the disks begin and end all on a single tower) in as few moves as possible, and for collecting all disks on a single tower when they begin in other configurations, again as quickly as possible. It introduces the
Hanoi graph In graph theory and recreational mathematics, the Hanoi graphs are undirected graphs whose vertices represent the possible states of the Tower of Hanoi puzzle, and whose edges represent allowable moves between pairs of states. Construction The p ...
s describing the state space of the puzzle, and relates numbers of puzzle steps to distances within this graph. After a chapter on "irregular" puzzles in which the initial placement of disks on their towers is not sorted, chapter four discusses the "Sierpiński graphs" derived from the
Sierpiński triangle The Sierpiński triangle (sometimes spelled ''Sierpinski''), also called the Sierpiński gasket or Sierpiński sieve, is a fractal curve, fractal attractive fixed set with the overall shape of an equilateral triangle, subdivided recursion, recu ...
; these are closely related to the three-tower Hanoi graphs but diverge from them for higher numbers of towers of Hanoi or higher-dimensional Sierpinski fractals. The next four chapters concern additional variants of the tower of Hanoi, in which more than three towers are used, the disks are only allowed to move between some of the towers or in restricted directions between the towers, or the rules for which disks can be placed on which are modified or relaxed. A particularly important case is the Reve's puzzle, in which the rules are unchanged except that there are four towers instead of three. An old conjecture concerning the minimum possible number of moves between two states with all disks on a single tower was finally proven in 2014, after the publication of the first edition of the book, and the second edition includes this material. Some of the definitions and proofs are extended into the book's many exercises. A new chapter in the second edition provides hints and partial solutions, and the final chapter collects open problems and (in the second edition) provides updates to previously-listed problems. Many color illustrations and photographs are included throughout the book.


Audience

The book can be read both by mathematicians working on topics related to the tower of Hanoi puzzle, and by a general audience interested in recreational mathematics. Reviewer László Kozma describes the book as essential reading for the first type of audience and (despite occasional heavy notation and encyclopedic detail) accessible and interesting to the second type, even for readers with only a high school level background in mathematics. On the other hand, reviewer Cory Palmer cautions that "this book is not for a casual reader", adding that a good understanding of
combinatorics Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many appl ...
is necessary to read it, and reviewer Charles Ashbacher suggests that it has enough depth of content to be the topic of an advanced undergraduate elective course. Although generally positive, reviewer S. V. Nagaraj complains about a "significant number of errors" in the book. Reviewer Andrew Percy calls it "an enjoyable adventure", "humorous, and very thorough". Reviewer Martin Klazar calls the book "wonderful", recommending it to anyone interested in recreational mathematics or mathematics more generally.


References


External links


Home page
{{DEFAULTSORT:Tower of Hanoi, Myths and Maths, The Mechanical puzzles Mathematics books 2013 non-fiction books 2018 non-fiction books Birkhäuser books