Think before you claim

[bloodies]

Some players don't understand how easy 4 questions can sometimes be solved using 1-2 questions and claim others as cheaters. LOL.

[Romain672]

They just don't know one point of the rule.
I wrote about it in 'strategy tips' down, visible here: https://en.doc.boardgamearena.com/Tips_turingmachine

[Murr_Rockstroh]

What about someone solving asking zero questions?

I know what they're doing, and I believe it is not in the spirit of the game.

Do I call it cheating? No, but I also tag them as someone I want to avoid being with in a game.

[Ez0ah]

Tbh, you probably could solve it in 0 questions, if you are willing to take a gamble between 2-3 possibilities in some cases.

[ufm]

What about someone solving asking zero questions?

I know what they're doing, and I believe it is not in the spirit of the game.

Do I call it cheating? No, but I also tag them as someone I want to avoid being with in a game.

Some combinations can be solved without any questions.
If you don't understand why, you should avoid them for a different reason: you can't beat them anyway.

[nccc]

@Ez0ah @ufm
any example?

[Jellby]

#B46 9ZH

A: 01: Blue = 1 | Blue > 1
B: 06: Yellow even | Yellow odd
C: 09: 0 threes | 1 three | 2 threes | 3 threes
D: 20: triple | double | no repetition

You can exclude "3 threes", because that would already make the other verifiers redundant. That leaves 36 other possible combinations. Similarly, "2 threes" can be excluded, as it would make verifier D redundant. Most of the remaining 24 cases don't have enough information to give a unique solution, and there's a single combination that satisfies the uniqueness requirement.

[Romain672]

#B46 9ZH

A: 01: Blue = 1 | Blue > 1
B: 06: Yellow even | Yellow odd
C: 09: 0 threes | 1 three | 2 threes | 3 threes
D: 20: triple | double | no repetition

You can exclude "3 threes", because that would already make the other verifiers redundant. That leaves 36 other possible combinations. Similarly, "2 threes" can be excluded, as it would make verifier D redundant. Most of the remaining 24 cases don't have enough information to give a unique solution, and there's a single combination that satisfies the uniqueness requirement.

Tested it on my solver. It's wrong, you got 2 solutions: 114 & 555.

@Ez0ah @ufm
any example?

I writed a custom one in the tips page: https://en.doc.boardgamearena.com/Tips_turingmachine

[Jellby]

Tested it on my solver. It's wrong, you got 2 solutions: 114 & 555.

I could be wrong, of course. But if it's 114, how would you tell it apart from 112, 115, 114, 151, 155...? All would check "blue = 1", "yellow odd", "0 threes", "one double".

[Romain672]

Tested it on my solver. It's wrong, you got 2 solutions: 114 & 555.

I could be wrong, of course. But if it's 114, how would you tell it apart from 112, 115, 114, 151, 155...? All would check "blue = 1", "yellow odd", "0 threes", "one double".

Yeah apparently someone already corrected my solver, so I don't know where my error came from, but yeah now he show only 555. So you was right.

I should have think before I claimed.