Algorithmic Ways for Mathematical Puzzles introduces puzzles from all over the world, past and present, from the perspective of theoretical computer science. Certain types of puzzles have contributed greatly to the development of this field. In fact, the latest puzzles often provide new research themes for computer scientists, whether the puzzle designer intended this outcome or not.
This book explores the current landscape, including such unsolved problems that are still extant. The contents of this book can be read by high school students with reasonable mathematical comprehension skills, but from an academic level it is mainly targeted at undergraduate and graduate students with an interest in algorithms and an appetite for puzzles.
Features

• Presents a wonderfully engaging teaching resource for a class on algorithmics
• Full of interesting and previously unpublished puzzles
• Copiously illustrated in full colour.