Games, puzzles, and computation
by Robert A. Hearn, Erik D. Demaine · first published 2009
2mentions
2recommended by
2HN commenters
2013–2021first – last mentioned
100% recommend
Affiliate links. As an Amazon Associate I earn from qualifying purchases.
I have a book called Games, Puzzles, and Computation (Hearn & Demaine). It discusses and proves the hardness of various games and puzzles. Not the scale of AAA titles, though. It's an interesting read. Not too mathy. They make clause gadgets in the same…
on “Classic Nintendo Games are NP-Hard” ↗If you enjoy this kind of paper, then I highly recommend this book: https://www.routledge.com/Games-Puzzles-and-Computation/Hear... It has a huge number of examples of how to build similar gadgets using lots of different kinds of games.
on “Any Monotone Boolean Function Can Be Realized by Interlocked Polygons (2010)” ↗