Turing Machine [Solo Gaming Sunday: Turing Machine Edition]

[@330nate]

The key if any verifiers say that one number is less than or greater than another number or both numbers, is that you already know there isn’t a triple digit or else that verifier would never pass. Also if you find out that Triangle is the smallest compared to either just 1 or both of the other digits, you now know that triangle is not 5 and that the other digit(s) are not 1. This is because if triangle is smaller than something it can’t be equal to it

[@boardgameswiththomas]

That is really good to know. I appreciate the advice!

[@JorWat25]

Here's my attempt to really streamline the final problem: If F is ascending or descending, then C is redundant. F is 'neither'. If C is 'Square smallest' or 'Circle smallest', then by definition, Triangle can't be 1, making A is redundant. C is 'Triangle smallest'. If E is 'Triangle + Square > 6', then there's no way for Triangle to equal 1, as the most Triangle + Square could then be is 6, which makes A redundant. And if E is '=6', making A be 'Triangle > 1' forces Triangle and Square to be 2 and 4, which makes B redundant, and making A be 'Triangle = 1' forces Square to be 5, also making B redundant. So E must be ' 1', we know that Triangle isn't 1, and if it were 3 or more, there we wouldn't be able to make both Triangle + Square be less than 6 and make Triangle less than Square. So Triangle must be 2. And by extension, Square must be 3 (so E is true). And Circle can't be 1 or 2 (then Triangle wouldn't be the smallest), nor 4 or 5 (then the digits would be ascending), so it must be 3. So the solution would be 233. But we never used B or D for this solution, so they're redundant. So A is 'Triangle = 1' If B is 'Square is even', then Square can only be 2 or 4. In either case, Triangle + Square < 6, so E would be redundant. So B is 'Square is odd'. We already know Triangle and Square are odd, so D can't be 'two evens' or 'three evens'. And if D is 'no evens', then B is redundant. So D is 'one even'. We've now deduced every condition without asking a single question and 132 is literally the only code it could possibly be.

[@boardgameswiththomas]

This is some impressive deduction! Seems pretty spot on. I've been doing the daily solo challenges since this video and have been slowly picking up the game more. So much can be gained from those initial deductions before even asking a question, especially when you have more Verifier Cards in play

[@JorWat25]

@@boardgameswiththomas Just be clear, you can't always do this. Especially once you start getting into the later cards which have overlapping criteria. Stuff like card 40 which is 'the number of one specific colour compared to 3', where there are nine different conditions possible, and every possible code satisfies three of them at once. For a specific example, I've not worked through it myself, but according to the game's designer on BGG, C46GQW (which has cards 2, 17, 40 and 48) has 92 possible codes. In no small part due to two of the cards having nine possible conditions each.

[@cigarbuff2]

This was fun to watch, while waiting for the game to arrive. Would you do another one soon?

[@boardgameswiththomas]

Glad you enjoyed it! Yes, I plan on streaming this game here in a couple weeks on October 23rd on my Solo Gaming Sunday Stream (6p EST). I'll be mostly doing Normal difficulty problems on that stream, though I plan to upload a video a few weeks after of me attempting some Hard difficulty problems

[@gh0st1596]

Great video! How did you make an erasable sheet? I need some as well :)

[@boardgameswiththomas]

Thanks! I made them by just putting some 'Laminating Paper' on the sheets

[@Mmtruempy]

Just a tip :) not ascending or descending does not mean chaos. It means it can not ascend or descend meaning based on the 1st and 2nd digit placement you can determine the last if all other last digit options would cause ascent or descent. I hope that makes sense

[@Mmtruempy]

So for game 6 you know circle is 5 or 3 and that Square is not 4 can’t be a repeat and is larger than triangle. So if triangle is smallest and it can’t be ascending, then circle can’t be the largest. Because that would cause ascension. So circle must be 3 and that makes square 5. That leaves triangle to be the only even number of 2. Hope that helps u see the value in the non ascending non descending clue :)

[@boardgameswiththomas]

This is a really good tip, thanks! I hadn't thought about it in that way before

[@EmmaNovaheim]

I was really confused at 1:53:12. From the start I had deduced A: 'Triangle > 1', as if it were 1, that would make card C obsolete. I thought you MUST have some new information from each card. But then the test failed, meaning Triangle is 1... 😭

[@boardgameswiththomas]

Good point! I'm not sure why that happened that way. I realized C was obsolete after I tested it

[@JorWat25]

No, Triangle being 1 would not make C obsolete, because C tells you not that no other digit is smaller than a specific digit, but that a specific digit is smaller than the other two. So while a lot of the codes that would satisfy 'Triangle = 1' also satisfy 'Triangle is smallest', something like '112' has Triangle as 1, but Triangle is not smaller than both other digits. In fact, in this specific case, removing C would make 112 and 132 both possible solutions. EDIT: That said, the logic the other way around does work. If C is 'Square smallest' or 'Circle smallest', then by definition, Triangle can't be 1, making A is redundant. So it's not that C causes A to be 'Triangle = 1', it's that A causes C to be 'Triangle is smallest'.

[@deezillusioned9909]

58:19 erases largest then writes largest

[@boardgameswiththomas]

Good catch! Lol. I was saying one thing but not paying attention to the paper