Magic Tricks, Card Shuffling, and Dynamic Computer Memories is a book that explores the fascinating interconnections between these seemingly unrelated topics. It is written for undergraduate mathematics, computer science, and electrical engineering majors, but it is accessible to motivated high school math students and magicians who want to understand the mathematics of card shuffling. It is a fun book that stands alone, but it could nicely supplement classes in discrete mathematics, combinatorics, algorithms, and computer networks. This book looks at the mathematics of the perfect shuffle and develops the algorithms for controlling dynamic memories (and doing some clever card tricks).Each chapter begins with the description of a card trick and ends with its explanation, usually using mathematics developed in the chapter. The book itself is designed as a prop for a trick, but you don't need to use or understand any of its mathematics to do some good magic.
Written by a distinguished author, the only person to obtain a Ph. D. in card shuffling, this book is a demonstration of deterministic amazement. Which is what card tricks really are. Enclosed in a wrapper of disingenuous talk and distracting motions, a card trick is a simple exercise in movement and memory. The process driving the movement is a mathematical one and many tricks are thoroughly explained here. Although the mathematics of card shuffling is surprisingly complex, it is not impossibly so and can be understood by advanced undergraduates. With many tricks explained in detail, as even the commentary is included, aspiring magicians will also find items of interest. Certainly one of the most interesting and recreational mathematics books published in some time, this book is almost all pure fun. It even includes some tricks within the text that you will not learn about until the end.
Published in Journal of Recreational Mathematics, reprinted with permission and this review appears on Amazon.