In my spare time (of which there is not enough), I have many recreational interests, but the one I spend by far the most time on is solving and constructing puzzles.

Logic Puzzles

My first exposure to logic puzzles was the "who owns the zebra"-style grid puzzles your elementary school teacher uses to keep you busy, and while I enjoy those (if they're interesting enough), I spend a lot more time on abstract logic puzzles, especially when I can do them in competitive situations. (Abstract logic puzzles are like sudoku in that they usually involve filling in cells with numbers, symbols, lines, or colors, based on some constraints. Once you know the constraints, the puzzles are language-neutral, so the solver and constructor don't have to share a language.

I have solved puzzles under the pseudonym Spelvin on many logic puzzle websites, including Logic Masters India, Croco-Puzzle (a German site that Chrome translates reasonably well), David Millar's site, The Griddle, and Nikoli's website. These days I dodn't spend much time on any of these sites due to lack of free time. I do consistently compete in the World Puzzle Federation's Puzzle and Sudoku Grand Prix events.

Every year I compete in the US Puzzle Championship, which determines the US team for the World Puzzle Championship. Most years I perform well enough to be named an alternate (sometimes ahead of people who make the team anyway due to grandfathering rules), but I've never been on the official team. I was part of the first B-team the US ever sent to the WPC (Eger, Hungary in 2005), and we did very well, although our results were officially unofficial. In August 2014, I attended my second WPC and first WSC (World Sudoku Championship) in London, as a member of the B-team for both events. I finally qualified as a member of the A-team in 2017, but unfortunately I couldn't make the trip.

My first full book of logic puzzles, The Puzzle Files of Larry Logic, was released in November 2014. You can find it in stores or order it on Amazon.

Word Puzzles

I'm also very fond of word puzzles and wordplay in general. I am a member, and used to be Secretary for, the National Puzzlers' League, the world's oldest puzzling organization. The NPL newsletter includes member-submitted puzzles in not my favorite types, though the cryptic crosswords are excellent. The real draw, however, is their yearly convention, where I get to see tons of nerdy friends and solve puzzles and play games. The name "Spelvin" I use on the logic sites above is my "nom de plume" in the NPL and comes from the traditional actor's pseudonym, George Spelvin.

I haven't been active recently, but I used to regularly attend the American Crossword Puzzle Tournament (if you've seen the film Wordplay, it's that tournament, and if you're eagle-eyed you might see me a few times). In my most recent appearance, I came in 18th, finishing second in the B division behind Dan Feyer, who has since won the entire tournament thrice so what can you do? I've also won the Westchester Crossword Tournament (a much smaller event) and the community division of the Brown Crossword Tournament. Most recently I finished in fifth place at the first Boswords tournament in Boston, and sixth at Lollapuzzoola 2017 in Manhattan.

I don't write many traditional crosswords, but I write one or two cryptic crosswords a year. These are crosswords with "cryptic clues," which are much more prevalent in the UK and give the solver both a definition of the answer and a wordplay indicator mashed up into one clue. If you are intrigued by the idea that "Fragile items he will start to stow after safecrackers abandon club" leads to the answer EGGSHELLS, there's a tutorial here.

At some point I'll post some of the variety cryptics I've written although many of them are specifically themed to the locations of NPL conventions. If you're just learning cryptics, there are a lot of accessible examples at Kegler's Kryptics. If you're more seasoned, the NPL has an excellent collection of cryptics downloadable for free, which includes my first bookstore-published puzzle. (The physical book's out of print now.)


When it comes to puzzles, my biggest passion by far is puzzlehunts. Mostly descended from a combination of the MIT Mystery Hunt and Stanford's drive-around event The Game, these events involve solving a collection of puzzles of highly variant types, the answers to which somehow combine to form metapuzzles which advance you farther toward a certain goal. The MIT Hunt is a "hunt" for a coin, but in many puzzlehunts, the ultimate goal is simply a final solution, and the nomenclature is mostly inherited from other events. I maintain a puzzlehunt blog called Puzzlvaria.

A running gag about these events that the puzzles frequently lack instructions, so in addition to solving, you need to figure out how to solve. Some people find this annoying, but I love it, as it requires a certain lateral thinking that I've become quite good at. I also like the fact that, as opposed to a crossword or sudoku competition where you are required to fill in every square, the goal of a puzzlehunt puzzle is to get to a short answer, and often one can bypass part of the solving via creative thinking (or "wheel-of-fortuning" missing letters in the final clue). Thus, analyzing the big picture and determining the most efficient way to get from Point A to Point B becomes a very useful skill.

Some of the puzzlehunts for which I have written puzzles include:

I highly recommend the puzzlehunts written by Foggy Brume in P&A Magazine, a bimonthy e-zine of puzzles which costs a measly $6 an issue, and by Mark Halpin, who writes a hunt every year for Labor Day. Mark's puzzles are free, but his work is well worth throwing something in the tip jar.

My friends at Brown and I used to compete as The Sons of Tamarkin in the big three Australian puzzlehunts, run by the University of Melbourne, the University of Sydney, and CISRA (now defunct).

Finally, each year that I'm not on a team writing the MIT Hunt, I used to prepare a warmup hunt for my team in anticipation of trying to win the Hunt. (These mini-hunts are later released to the Internet at large.) You can find eight(!) of them here. The first two are kind of light; 2006 is when I started writing more substantive puzzles for these.