![]() Hinz is Professor at the Department of Mathematics, University of Munich (LMU), Germany. Bultheel, The European Mathematical Society, February, 2013)Īndreas M. … Also if you are looking for a lifelasting occupation, then you may find here a list of open problems that will keep you busy for a while.” (A. … Thus if you love puzzles, and more in particular the mathematics behind it, this is a book for you. “Gives an introduction to the problem and the history of the TH puzzle and other related puzzles, but it also introduces definitions and properties of graphs that are used in solving these problems. … It was surprising to learn that the ‘simple’ problem of the Tower of Hanoi … could be the subject of a full semester special topics course in advanced mathematics.” (Charles Ashbacher, MAA Reviews, May, 2013) … there is enough implied mathematics in the action to make it interesting to professional mathematicians. “The Tower of Hanoi is an example of a problem that is easy to state and understand, yet a thorough mathematical analysis of the problem and its extensions is lengthy enough to make a book. Comprehensive mathematics collections, upper-division undergraduates through researchers/faculty.” (M. … The authors explain all the combinatorial concepts they use, so the book is completely accessible to an advanced undergraduate student. “This research monograph focuses on a large family of problems connected to the classic puzzle of the Tower of Hanoi. … As such, the book will be an enjoyable read for any recreational mathematician …. The exercises ending each chapter are an essential part of the explication providing some definitions … and some proofs of the theorems or statements in the main text. … The style of presentation is entertaining, at times humorous, and very thorough. “This book takes the reader on an enjoyable adventure into the Tower of Hanoi puzzle (TH) and various related puzzles and objects. … I haven’t enjoyed reading a ‘popular mathematics’ book as much for quite some time, and 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, Vol. “The Tower of Hanoi isn’t just a recreational problem, it is also a substantial area worthy of study, and this book does this area full justice. Despite many attempts to decide it and large-scale numerical experiments supporting its truth, it remains unsettled after more than 70 years and thus demonstrates the timeliness of the topic.Įnriched 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. Central among these is the famed Frame-Stewart conjecture. Numerous captivating integer sequences arise along the way, but also many open questions impose themselves. In view of the most important practical applications of the Tower of Hanoi and its variants, namely in physics, network theory, and cognitive (neuro)psychology, other related structures and puzzles like, e.g., the “Tower of London”, are addressed. Acknowledging the great popularity of the topic in computer science, algorithms and their correctness proofs form an essential part of the book. The main objects of research today are the so-called Hanoi graphs and the related Sierpiński graphs. Apart from long-standing myths it contains a thorough, largely self-contained presentation of the essential mathematical facts with complete proofs, including also unpublished material. The book comprises a survey of the historical development from the game’s predecessors up to recent research in mathematics and applications in computer science and psychology. ![]() This is the first comprehensive monograph on the mathematical theory of the solitaire game “The Tower of Hanoi” which was invented in the 19th century by the French number theorist Édouard Lucas.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |