How do you solve it in just six questions?
Posted: 17 February 2024, 12:43
Hello, everyone...
Since I am a non-English speaking person, I got help from Google to write in English.
I hope you will be lenient if there are any problems with grammar.
I play Turing Machine by solo game.
https://boardgamearena.com/5/turingmach ... =476259555
I find answer in 9 questions.
but, Machine find in 6 questions.
I don't understand to Machine's solve.
I feel like there's something missing in solving this game.
Please tell me, what I'm "missing" to beat the Machine.
I proceeded with the solution as follows.
-----------------------------------------------------------------------------------------------
First of all, "C2" and "F2" verifiers are incompatible.
(The upper card of each verifier will be referred to as number 1, and the lower card as number 2.)
This is because both verifiers show a correlation between a square and a certain number.
Once one verifier is decided, the verifier on the other side will be useless.
And, “F1” verifier and “D2” verifier are also the same.
So, I decided to focus on the "F" verifier.
It is not "F11" here.
Because the number of cases is too small.
124 > [ A B F ] > [
]
>> A is "A11" or "A21"
>> B is "B13" or "B21"
>> F is "F13" or "F22" or "F23"
132 > [ C E F ] > [ ]
>> F is "F23" (Square is greater than 3.)
>> E is "E13" or "E21"
>> C is "C11" (There are more even numbers than odd numbers.)
I knew a lot, but there didn't seem to be much I could deduct to find the answer.
512 > [ D E ] > [ ]
>> E is "E13" (It is not in ascending or descending order.)
>> D is "D12" or "D21" // “D23” was deducted due to insufficient number of cases.
Now, I focus on the "D" verifier.
"There are no consecutive numbers arranged in ascending or descending order." is too many cases.
The square was still either 4 or 5, and this proposition did not sufficiently reduce the number of cases.
Since there must be only one correct answer, "the circle is an odd number."
Now, I focus on the "B" verifier.
I found that this verifier always makes a triangle into 2 and a square into 4 even if it is not determined.
Because the circles are odd, the remainder is even. (C11)
"B13" and "B21" have something in common in that the triangles and squares refer to different numbers.
So I decided that the "A" verifier could solve everything.
If "A11" then, 243.
if "A21" then, 241.
245 cannot be the answer because it is in ascending order. (E13)
512 > [ A ] > [ ]
>> A is "A11" (A triangle is smaller than a circle.)
I find answer 243.
but, Machine is find in 6 questions.
I lost to the Machine.
Since I am a non-English speaking person, I got help from Google to write in English.
I hope you will be lenient if there are any problems with grammar.
I play Turing Machine by solo game.
https://boardgamearena.com/5/turingmach ... =476259555
I find answer in 9 questions.
but, Machine find in 6 questions.
I don't understand to Machine's solve.
I feel like there's something missing in solving this game.
Please tell me, what I'm "missing" to beat the Machine.
I proceeded with the solution as follows.
-----------------------------------------------------------------------------------------------
First of all, "C2" and "F2" verifiers are incompatible.
(The upper card of each verifier will be referred to as number 1, and the lower card as number 2.)
This is because both verifiers show a correlation between a square and a certain number.
Once one verifier is decided, the verifier on the other side will be useless.
And, “F1” verifier and “D2” verifier are also the same.
So, I decided to focus on the "F" verifier.
It is not "F11" here.
Because the number of cases is too small.
124 > [ A B F ] > [
]>> A is "A11" or "A21"
>> B is "B13" or "B21"
>> F is "F13" or "F22" or "F23"
132 > [ C E F ] > [
]>> F is "F23" (Square is greater than 3.)
>> E is "E13" or "E21"
>> C is "C11" (There are more even numbers than odd numbers.)
I knew a lot, but there didn't seem to be much I could deduct to find the answer.
512 > [ D E ] > [
]>> E is "E13" (It is not in ascending or descending order.)
>> D is "D12" or "D21" // “D23” was deducted due to insufficient number of cases.
Now, I focus on the "D" verifier.
"There are no consecutive numbers arranged in ascending or descending order." is too many cases.
The square was still either 4 or 5, and this proposition did not sufficiently reduce the number of cases.
Since there must be only one correct answer, "the circle is an odd number."
Now, I focus on the "B" verifier.
I found that this verifier always makes a triangle into 2 and a square into 4 even if it is not determined.
Because the circles are odd, the remainder is even. (C11)
"B13" and "B21" have something in common in that the triangles and squares refer to different numbers.
So I decided that the "A" verifier could solve everything.
If "A11" then, 243.
if "A21" then, 241.
245 cannot be the answer because it is in ascending order. (E13)
512 > [ A ] > [
]>> A is "A11" (A triangle is smaller than a circle.)
I find answer 243.
but, Machine is find in 6 questions.
I lost to the Machine.