Tips turingmachine - Revision history

Yzemaze: typos

2025-10-09T07:58:32Z

typos

← Older revision		Revision as of 09:58, 9 October 2025
Line 17:		Line 17:
	You can see that we have very little information about yellow and purple. No Verifiers give any information about yellow or purple to deduce their values amongst 1, 2, 3, or 5.		You can see that we have very little information about yellow and purple. No Verifiers give any information about yellow or purple to deduce their values amongst 1, 2, 3, or 5.

	The only information we could have for yellow and purple is regarding the number of 4 -- the total number of 4s (C). So we can deduce yellow and purple must be equal to 4 (said differently, if you find that the final solution is 414, then you will have ~~differents~~ solutions for yellow like 424, 434, 454 and no way to ~~distinct~~ them from each other, and this isn't possible. So yellow can't be 1, 2, 3, or 5. So y=4. Same for purple)		The only information we could have for yellow and purple is regarding the number of 4 – the total number of 4s (C). So we can deduce yellow and purple must be equal to 4 (said differently, if you find that the final solution is 414, then you will have different solutions for yellow like 424, 434, 454 and no way to distinguish them from each other, and this isn't possible. So yellow can't be 1, 2, 3, or 5. So y=4. Same for purple)

	Furthermore, if blue was equal to 1, then B&C would be enough (i.e., A and D would not be required -- impossible) to tell the combination is 144. So blue isn't equal to 1.		Furthermore, if blue was equal to 1, then B&C would be enough (i.e., A and D would not be required – impossible) to tell the combination is 144. So blue isn't equal to 1.

	If blue was 4 or 5, then B will be useless compared to D. Said differently, A&C&D are enough to tell if it's 444 or 544, and B would be useless, which isn't possible. So B isn't 4 or 5.		If blue was 4 or 5, then B will be useless compared to D. Said differently, A&C&D are enough to tell if it's 444 or 544, and B would be useless, which isn't possible. So B isn't 4 or 5.
Line 42:		Line 42:
	- if you remove Verifier D, there is 2+ solutions: 344 & 544		- if you remove Verifier D, there is 2+ solutions: 344 & 544

	So every Verifier is useful, and there is only one possibility at the end. Without the reasoning above, that just ~~mean~~ it's a valid solution, not that it's the only one.		So every Verifier is useful, and there is only one possibility at the end. Without the reasoning above, that just means it's a valid solution, not that it's the only one.

Romain672: for>from

2024-01-18T21:16:38Z

for>from

← Older revision		Revision as of 23:16, 18 January 2024
Line 17:		Line 17:
	You can see that we have very little information about yellow and purple. No Verifiers give any information about yellow or purple to deduce their values amongst 1, 2, 3, or 5.		You can see that we have very little information about yellow and purple. No Verifiers give any information about yellow or purple to deduce their values amongst 1, 2, 3, or 5.

	The only information we could have for yellow and purple is regarding the number of 4 -- the total number of 4s (C). So we can deduce yellow and purple must be equal to 4 (said differently, if you find that the final solution is 414, then you will have differents solutions for yellow like 424, 434, 454 and no way to distinct them ~~for~~ each other, and this isn't possible. So yellow can't be 1, 2, 3, or 5. So y=4. Same for purple)		The only information we could have for yellow and purple is regarding the number of 4 -- the total number of 4s (C). So we can deduce yellow and purple must be equal to 4 (said differently, if you find that the final solution is 414, then you will have differents solutions for yellow like 424, 434, 454 and no way to distinct them from each other, and this isn't possible. So yellow can't be 1, 2, 3, or 5. So y=4. Same for purple)

	Furthermore, if blue was equal to 1, then B&C would be enough (i.e., A and D would not be required -- impossible) to tell the combination is 144. So blue isn't equal to 1.		Furthermore, if blue was equal to 1, then B&C would be enough (i.e., A and D would not be required -- impossible) to tell the combination is 144. So blue isn't equal to 1.

Romain672: changed (how?) into a second way to explain

2024-01-18T21:14:05Z

changed (how?) into a second way to explain

← Older revision		Revision as of 23:14, 18 January 2024
Line 17:		Line 17:
	You can see that we have very little information about yellow and purple. No Verifiers give any information about yellow or purple to deduce their values amongst 1, 2, 3, or 5.		You can see that we have very little information about yellow and purple. No Verifiers give any information about yellow or purple to deduce their values amongst 1, 2, 3, or 5.

	The only information we could have for yellow and purple is regarding the number of 4 -- the total number of 4s (C). So we can deduce yellow and purple must be equal to 4. ~~(how?~~)		The only information we could have for yellow and purple is regarding the number of 4 -- the total number of 4s (C). So we can deduce yellow and purple must be equal to 4 (said differently, if you find that the final solution is 414, then you will have differents solutions for yellow like 424, 434, 454 and no way to distinct them for each other, and this isn't possible. So yellow can't be 1, 2, 3, or 5. So y=4. Same for purple)

	Furthermore, if blue was equal to 1, then B&C would be enough (i.e., A and D would not be required -- impossible) to tell the combination is 144. So blue isn't equal to 1.		Furthermore, if blue was equal to 1, then B&C would be enough (i.e., A and D would not be required -- impossible) to tell the combination is 144. So blue isn't equal to 1.

Divasatanica: Asking for reasoning, since it is not clear

2024-01-16T11:07:18Z

Asking for reasoning, since it is not clear

← Older revision		Revision as of 13:07, 16 January 2024
Line 17:		Line 17:
	You can see that we have very little information about yellow and purple. No Verifiers give any information about yellow or purple to deduce their values amongst 1, 2, 3, or 5.		You can see that we have very little information about yellow and purple. No Verifiers give any information about yellow or purple to deduce their values amongst 1, 2, 3, or 5.

	The only information we could have for yellow and purple is regarding the number of 4 -- the total number of 4s (C). So we can deduce yellow and purple must be equal to 4.		The only information we could have for yellow and purple is regarding the number of 4 -- the total number of 4s (C). So we can deduce yellow and purple must be equal to 4. (how?)

	Furthermore, if blue was equal to 1, then B&C would be enough (i.e., A and D would not be required -- impossible) to tell the combination is 144. So blue isn't equal to 1.		Furthermore, if blue was equal to 1, then B&C would be enough (i.e., A and D would not be required -- impossible) to tell the combination is 144. So blue isn't equal to 1.

Snoozefest: a bit more explanation, spelling fixes

2024-01-09T19:22:07Z

a bit more explanation, spelling fixes

← Older revision		Revision as of 21:22, 9 January 2024
Line 2:		Line 2:


	All ~~verificators~~ are ~~useful.~~ You can gain a lot of information from it. Let's take an example, the ~~verificators~~ are:
			All Verifiers are required to deduce the code, but you don't necessarily need to ''use'' them all! You can gain a lot of information simply from noting which ones are present. Let's take an example, the Verifiers are:

	A) blue is odd \| blue is even		A) blue is odd \| blue is even
Line 12:		Line 13:
	D) blue <4 \| blue >3		D) blue <4 \| blue >3

	So firstly, if the answer is '444', that would mean that the ~~verificators~~ A, B, and D ~~will~~ be ~~useless which~~ is not possible, so it's not 444.		So firstly, if the answer is '444', that would mean that the Verifiers A, B, and D would not be required since C alone could find the solution. That is not possible, so it's not 444.

	You can see that we have ~~really few~~ information about yellow and purple. ~~If the answer is 123~~, ~~then no verificator would tell the difference with the code 133. So that mean yellow can't be~~ 2 or 3.		You can see that we have very little information about yellow and purple. No Verifiers give any information about yellow or purple to deduce their values amongst 1, 2, 3, or 5.

	The only information we could have for yellow and purple is the number of 4. So we can deduce yellow and purple ~~are~~ equal to 4.		The only information we could have for yellow and purple is regarding the number of 4 -- the total number of 4s (C). So we can deduce yellow and purple must be equal to 4.

	Furthermore, if blue was equal to 1, then B&C ~~woud~~ be enough to tell the ~~combinaison~~ is 144. So blue isn't equal to 1.		Furthermore, if blue was equal to 1, then B&C would be enough (i.e., A and D would not be required -- impossible) to tell the combination is 144. So blue isn't equal to 1.

	If blue was 4 or 5, then B will be useless compared to D. ~~Say diferently~~, A&C&D are enough to tell if it's 444 or 544, and B would be useless, which isn't possible. So B isn't 4 or 5.		If blue was 4 or 5, then B will be useless compared to D. Said differently, A&C&D are enough to tell if it's 444 or 544, and B would be useless, which isn't possible. So B isn't 4 or 5.

	So, the two remaining ~~combinaisons~~ possible are 244 and 344.		So, the two remaining combinations possible are 244 and 344.

	But now, if you ~~look at 244, and verificators ACD, we got two~~ 4s, blue ~~equal to~~ 1, 2~~, or~~ 3, ~~and blue~~ even... ~~Which mean, it~~'~~s already 244 without using~~ B. ~~So B is useless. So it's not that~~, and it's not 244.		But now, consider 244. Verifier C tells you there are 2 4s, D tells you blue is 1/2/3, A says it's the even one = 2 ... you didn't need to use B. But all Verifiers are required so blue cannot be 2, and it's not 244.


Line 33:		Line 34:
	- with those answers (blue odd, blue>1, two 4s, blue<4), there is only one possibility: blue is forced to be at 3, and so y & p are forced to be at 4		- with those answers (blue odd, blue>1, two 4s, blue<4), there is only one possibility: blue is forced to be at 3, and so y & p are forced to be at 4

	- if you remove ~~verificator~~ A, there is 2+ solutions: 244 & 344		- if you remove Verifier A, there is 2+ solutions: 244 & 344

	- if you remove ~~verificator~~ B, there is 2+ solutions: 144 & 344		- if you remove Verifier B, there is 2+ solutions: 144 & 344

	- if you remove ~~verificator~~ C, there is 2+ solutions (25): per example 325 & 314		- if you remove Verifier C, there is 2+ solutions (25): per example 325 & 314

	- if you remove ~~verificator~~ D, there is 2+ solutions: 344 & 544		- if you remove Verifier D, there is 2+ solutions: 344 & 544

	So every ~~verificator~~ is useful, and there is only one possibility at the end. Without the ~~reasonning~~ above, that just mean it's a valid solution, not that it's the only one.		So every Verifier is useful, and there is only one possibility at the end. Without the reasoning above, that just mean it's a valid solution, not that it's the only one.

Romain672 at 00:34, 5 January 2024

2024-01-05T00:34:56Z

← Older revision		Revision as of 02:34, 5 January 2024
Line 4:		Line 4:
	All verificators are useful. You can gain a lot of information from it. Let's take an example, the verificators are:		All verificators are useful. You can gain a lot of information from it. Let's take an example, the verificators are:

	A) ~~parity of the~~ blue ~~number~~		A) blue is odd \| blue is even

	B) blue ~~number~~ >1		B) blue >1 \| blue = 1

	C) ~~number of 4s in the combinaison~~		C) no 4 \| one 4 \| two 4 \| three 4

	D) blue ~~number~~ <4		D) blue <4 \| blue >3

	So firstly, if the answer is '444', that would mean that the verificators A, B, and D will be useless which is not possible, so it's not 444.		So firstly, if the answer is '444', that would mean that the verificators A, B, and D will be useless which is not possible, so it's not 444.

Romain672: verification part

2023-08-23T07:13:54Z

verification part

← Older revision		Revision as of 09:13, 23 August 2023
Line 28:		Line 28:

	And so it's exactly 344 with 0 check.		And so it's exactly 344 with 0 check.

			And we can verify it:

			- with those answers (blue odd, blue>1, two 4s, blue<4), there is only one possibility: blue is forced to be at 3, and so y & p are forced to be at 4

			- if you remove verificator A, there is 2+ solutions: 244 & 344

			- if you remove verificator B, there is 2+ solutions: 144 & 344

			- if you remove verificator C, there is 2+ solutions (25): per example 325 & 314

			- if you remove verificator D, there is 2+ solutions: 344 & 544

			So every verificator is useful, and there is only one possibility at the end. Without the reasonning above, that just mean it's a valid solution, not that it's the only one.

Romain672: corrected a mistake

2023-08-22T11:39:58Z

corrected a mistake

← Older revision		Revision as of 13:39, 22 August 2023
Line 22:		Line 22:
	If blue was 4 or 5, then B will be useless compared to D. Say diferently, A&C&D are enough to tell if it's 444 or 544, and B would be useless, which isn't possible. So B isn't 4 or 5.		If blue was 4 or 5, then B will be useless compared to D. Say diferently, A&C&D are enough to tell if it's 444 or 544, and B would be useless, which isn't possible. So B isn't 4 or 5.

	So, the two remaining combinaisons possible are 244 and 344. ~~You just have~~ to ~~write any combinaison~~, ~~check the parity of the~~ blue ~~number with A~~, and ~~propose~~ 244 ~~or 344~~. And ~~you end the game in one move~~.		So, the two remaining combinaisons possible are 244 and 344.

			But now, if you look at 244, and verificators ACD, we got two 4s, blue equal to 1, 2, or 3, and blue even... Which mean, it's already 244 without using B. So B is useless. So it's not that, and it's not 244.


			And so it's exactly 344 with 0 check.

Romain672: Unicity (need english speaker correction)

2023-08-21T11:33:48Z

Unicity (need english speaker correction)

New page

'''Unicity'''

All verificators are useful. You can gain a lot of information from it. Let's take an example, the verificators are:

A) parity of the blue number

B) blue number >1

C) number of 4s in the combinaison

D) blue number <4

So firstly, if the answer is '444', that would mean that the verificators A, B, and D will be useless which is not possible, so it's not 444.

You can see that we have really few information about yellow and purple. If the answer is 123, then no verificator would tell the difference with the code 133. So that mean yellow can't be 2 or 3.

The only information we could have for yellow and purple is the number of 4. So we can deduce yellow and purple are equal to 4.

Furthermore, if blue was equal to 1, then B&C woud be enough to tell the combinaison is 144. So blue isn't equal to 1.

If blue was 4 or 5, then B will be useless compared to D. Say diferently, A&C&D are enough to tell if it's 444 or 544, and B would be useless, which isn't possible. So B isn't 4 or 5.

So, the two remaining combinaisons possible are 244 and 344. You just have to write any combinaison, check the parity of the blue number with A, and propose 244 or 344. And you end the game in one move.