As perhaps hinted by the provocative title, this slim text is an entertaining run through 11 classical logic problems that can easily surprise the reader in both presentation and solutions. Multiple sub-puzzles emerge along with entrancing illustrations by a Tamil-based Indian colleague. One of the authors has previously edited a broadly based volume on the subject [1].

Each of the first 11 chapters uses a classic logic problem as the focus. Some may be familiar to fans of logic puzzles. They include: hangman, muddy children, Monty Hall, Russian cards, sum and product, two envelopes, gossip, and cluedo. Most include variants on the classics (and it may be that the reader knows only of a variant), along with a solution and an informative history of the problem. Good references are included at each step along the way. Answers to all puzzles are provided in a final chapter, although they are logic rather than programming solutions. There is no index; however, there is a good bibliography.

Chapter 12 is an “overview of dynamic epistemic logic”; as a non-expert, I found it both informative and hard to integrate into my thinking. It is either perhaps too brief or lacks some more practical implementation aspects that would make it more concrete to the computer scientist. And this points to the one drawback of the book for a computer science audience: there are neither demonstrated programmatic solutions, nor, more to the point, are there pointers to such. For that, one would have to consult other texts that are more academic oriented [2,3] or practice oriented.