Gamehelpturingmachine

Overview

There is an unknown code consisting of 3 digits (1-5), corresponding to 3 colored shapes (blue triangle, yellow square, purple circle). Digits may appear more than once in each code.

You're given a number of verifier cards, each tests a specific criteria of the code, and tells you if your guess meets this criteria.

The objective of the game is to solve the code in as few moves as possible. By inputting trial codes (proposals) and testing them with the verifiers.

Turn

A turn consists of four or five stages.

1. Compose
2. Question
3. Deduce
4. End
5. Verification (Not in all rounds)

All players carry out their turns simultaneously.

Compose

In this phase, each player inputs a 3-digit proposal code.

Question

Players pick up to three of the Verifiers to test their Proposal.

Each verifiers tests a specific criteria of the code, and tells you if your proposal passes or fails said criteria.

For example:

A verifier might test if the value of yellow is 3, lower than 3, or higher than 3.

If you input a proposal of 325 (2 for yellow). And the verifier returns as a fail. If 325 returns as failed. That means yellow is either 3, or higher than 3.

If 325 returns as passed. You now know the value of yellow in the answer is lower than 3.

Note: the verifier doesn't tell you your input is correct. If the answer code has a 1 for yellow, your 2 will pass despite being the incorrect value.

Each verifier can be used only once per turn. But can be used again on a new proposal on your next turn.

the same colour/shape, or

1. The Verifiers do NOT correspond to colors and/or shapes. For example:
   1. Two Verifiers may contain criteria towards the same colour/shape, or
   2. may ask if Yellow/Square is greater than three)
   3. Another Verifier may ask if Yellow/Square is greater than three)
2. The Correct and Incorrect answer received does NOT mean the number is right or wrong, but whether or not your proposal passed for that the Verifier.

Deduce

After completing the Verification step, take some time to figure out (but not declare) if you have found the answer.

End

At the end, count to three, then reveal either a thumbs up (if think you know the code) or a thumbs down (if you are not sure of the code)

If everyone pointed down, return to Compose Phase

If at least one person pointed up, move to the Verification Phase

Verification

The correct code will pass the test of ALL verifiers

If one person is correct, they win!

If more than one person is correct, the person who asked the fewest questions wins!

If no one is correct, they are eliminated!

If the second to last person is eliminated, the final player, even though they did not participate in Verification, will win!

Meaning of verifiers

Each of the verifiers tell you that one of the criteria tested is true or not.

Per example if it exist a verifier which tell you if [(b<3) or (y<3) or (p<3)], that assure you that the color tested is <3. By testing 222, in all games that verifier would return true (so it's useless to ask). If you test 225, it can return true or false. If it return false, then p<3. If it return true, then you don't know if b<3 or if y<3 or if both are true. If you test 555, it will always return false (so it's useless to ask).

Mode

Classic

1 card for each verifier.

Extreme

2 cards for each verifier but only one valid criterion.

Nightmare

You do not know which verifier is associated with which verification card.

Strategy (spoilers)

Each verifier is useful and at the end there is a single solution.

If there is a verifier which test if b<y, b=y, or b>y ; and another test if b<yp, y<bp, or p<by, then if y<bp, that makes the first verifier useless. Same for b<yp. So the second verificator is p<by.

If there is a verifier about the numbers of 4s in the combinaisons, and no others verifiers tell you information about purple, then if p=1, you could have another solution by making p=2. Same for 3&5. So p=4.

For more information, check the following page: Tips turingmachine .