I’m going to run a round or two of the board game Turing Machine.

This game is a interesting logic puzzle. You are trying to solve a code of the form BLUE-YELLOW-PURPLE, where each color is a number between 1 to 5.

One turn of the game consists of the following steps:

- You choose a 3 digit number to test, and you can choose up to 3 verifiers to test it against, and send it to me via DM.
- I send you Yes or No for each of the verifiers you tested your number against.
- You respond in the thread ‘Ready for Next Round’ or ‘Attempt to Solve’

If you attempt to solve and fail, then you are out of the game. If you succeed, then the game ends, and the player who solves it that round with the fewest verifier queries wins.

Some facts about the ‘verifiers’:

- There will be 4 verifiers
- The final code is the only possible code that will give a yes on all 4 verifiers.
- You will not know to start what the verifier is testing, that information is to be deduced.
- Each verifier will be testing the same question for all guesses for all players in a single game.
- All games have a unique answer, if you can prove that a verifier that was testing the statement A would lead to no unique solution, then it is valid to rule out A.

How about an example:

Verifier A is “This verifier tests the parity of one of the colors.”

You submit 3-3-3 to me (remember, this is blue-yellow-purple), and ask to use verifier A.

I respond ''No".

You know the verifier is not testing ‘Blue is odd’, ‘Yellow is odd’ or ‘Purple is odd’ because if it was testing one of those statements, it would have said yes. (Note this doesn’t mean that Yellow isn’t odd in the final code, if the verifier is testing ‘Blue is even’ then it doesn’t care about your yellow number.)

Interested, sign up below by posting. I’ll start the morning after we get 5 people or on Wednesday, July 26th at the latest.