Presented to you through Paradigm Publishing Services
Princeton University Press
Chapter
Licensed
Unlicensed
Requires Authentication
2. Dragons and Kasha
You are currently not able to access this content.
You are currently not able to access this content.
Chapters in this book
- Frontmatter i
- Contents v
- Foreword vii
- Preface and Acknowledgments xi
-
PART I. PUZZLES AND BRAINTEASERS
- 1. The Cyclic Prisoners 3
- 2. Dragons and Kasha 11
- 3. The History and Future of Logic Puzzles 23 Jason Rosenhouse 23
- 4. The Tower of Hanoi for Humans 52
- 5. Frenicle’s 880 Magic Squares 71
-
PART II GEOMETRY AND TOPOLOGY
- 6. A Triangle Has Eight Vertices But Only One Center 85
- 7. Enumeration of Solutions to Gardner’s Paper Cutting and Folding Problem 108
- 8. The Color Cubes Puzzle with Two and Three Colors 125
- 9. Tangled Tangles 141
-
PART III GRAPH THEORY
- 10. Making Walks Count: From Silent Circles to Hamiltonian Cycles 157
- 11. Duels, Truels, Gruels, and Survival of the Unfittest 169
- 12. Trees, Trees, So Many Trees 195
- 13. Crossing Numbers of Complete Graphs 218
-
PART IV GAMES OF CHANCE
- 14. Numerically Balanced Dice 253
- 15. A TROUBLE-some Simulation 269
- 16. A Sequence Game on a Roulette Wheel 286
-
PART V COMPUTATIONAL COMPLEXITY
- 17. Multinational War Is Hard 301
- 18. Clickomania Is Hard, Even with Two Colors and Columns 325
- 19. Computational Complexity of Arranging Music 364
- About the Editors 379
- About the Contributors 381
- Index 387
Chapters in this book
- Frontmatter i
- Contents v
- Foreword vii
- Preface and Acknowledgments xi
-
PART I. PUZZLES AND BRAINTEASERS
- 1. The Cyclic Prisoners 3
- 2. Dragons and Kasha 11
- 3. The History and Future of Logic Puzzles 23 Jason Rosenhouse 23
- 4. The Tower of Hanoi for Humans 52
- 5. Frenicle’s 880 Magic Squares 71
-
PART II GEOMETRY AND TOPOLOGY
- 6. A Triangle Has Eight Vertices But Only One Center 85
- 7. Enumeration of Solutions to Gardner’s Paper Cutting and Folding Problem 108
- 8. The Color Cubes Puzzle with Two and Three Colors 125
- 9. Tangled Tangles 141
-
PART III GRAPH THEORY
- 10. Making Walks Count: From Silent Circles to Hamiltonian Cycles 157
- 11. Duels, Truels, Gruels, and Survival of the Unfittest 169
- 12. Trees, Trees, So Many Trees 195
- 13. Crossing Numbers of Complete Graphs 218
-
PART IV GAMES OF CHANCE
- 14. Numerically Balanced Dice 253
- 15. A TROUBLE-some Simulation 269
- 16. A Sequence Game on a Roulette Wheel 286
-
PART V COMPUTATIONAL COMPLEXITY
- 17. Multinational War Is Hard 301
- 18. Clickomania Is Hard, Even with Two Colors and Columns 325
- 19. Computational Complexity of Arranging Music 364
- About the Editors 379
- About the Contributors 381
- Index 387