Parallel Weighings

I introduce, solve and generalize a new coin puzzle that involves parallel weighings.Comment: 11 page

Hat Puzzles

This paper serves as the announcement of my program---a joke version of the Langlands Program. In connection with this program, I discuss an old hat puzzle, introduce a new hat puzzle, and offer a puzzle for the reader.Comment: 6 pages, 8 figure

Attacking ApSimon's Mints

ApSimon's Mints problem is a very difficult and often misunderstood counterfeit-coin puzzle. I explain the problem and suggest ways to approach it, while giving several fun exercises for the reader.Comment: 4 page

mm-Modular Wythoff

We introduce a variant of Wythoff's Game that we call $m$-Modular Wythoff's Game. In the original Wythoff's Game, players can take a positive number of tokens from one pile, or they can take a positive number of tokens from both piles if the number of tokens they take from the first pile is equal to the number of tokens they take from the second. In our variant, we weaken this equality condition to one of equivalence modulo $m$. We characterize the P-positions of our $m$-Modular variant as a finite subset of the P-positions of the known P-positions of the original Wythoff's Game.Comment: 14 page