Are there any setups by the Turing Machine manufacturer that we know of that use the fact that a verifier is required to complete the code BUT the verifier also does not ever produce a true for the given code? Example below:
For b = blue, y = yellow and p = purple you could have:
- b = 2
- y = 3
- p = 3
You could also have the verifiers:
- v1 = one colour is less than the other two
- v2 = yellow is =/>/< 3
- v3 = there are x even numbers
- v4 = one colour is greater than the other two
Using that you can get the following results from the verifiers (eventually):
- v1: blue is < yellow or purple
- v2: yellow = 3
- v3: there is 1 even number
- v4: all results are negative
In this case BECAUSE all results on v4 are negative, the code is solvable and is b2 y3 p3
IF v4 had a positive for p > b/y then the result would also be meaningful: b2 y3 p5
Therefore in this case v4 is both: required for the solution AND provides only negative results for this code
I’m interested in whether the game setup provided by the manufacturer uses this feature to allow for such games. It seems ‘legal’ within the game rules, but it’s not clear whether these cases are actually provided and I can imagine that for ‘ease of understanding/play’ they might have shied away from those setups.
It’s relevant because knowing whether they are possible setups or not affects your number of guesses. If it’s not possible, then you can assume the above case HAS TO BE the p5 solution and do (potentially) at least one less guess of the verifiers