วีดีโอ

If you like being challenged, I suggest looking into buying the actual board game Turing Machine. There are more difficult levels. Go to turingmachine dot info website and read the instruction manual to get a better idea. Thanks for watching the video and commenting. Cheers!

You mentioned you play Turing Machine on Board Game Arena. How do you like it ?

@@DTMP_YT Turing Machine is implemented well in Board Game Arena. The Daily Challenges are always updated and there are different modes of play as well. Plus there's a lot more board games available in BGA :)

@@p46288 Oh, the Daily Challenge is already integrated into the game ?! That's so cool and convenient. I had no idea. Can you also look up puzzles by their codes ?

@@DTMP_YT Yes, you can also enter a code and start the game for that :) I actually did that for the previous daily challenges because I can't wait for the next day! lol!

At 11:35, you deduced that triangle cannot be 4. I think that's inconclusive because Verifier C could say the smallest is square which means that the code can be 424 or 434. Or please let me know if I missed something else. :)

Thanks so much ! I'm glad you were able to find this channel. If you're looking for additional information about Turing Machine, you should check out boardgamegeek.com. There are tons of cool resources. Keep watching . And thanks again.

Ah, I think I get it now. There will be no verifier that could rule out either of 424 or 434 which means that triangle cannot be 4. Nice!

Thanks for the feedback. Yeah, I didn't do a good job on this video explaining why I concluded that T not = 4 was reasonable. In other videos I mention that if there are what I call ambiguous solutions that they can be discarded. Ambiguous solutions are potential solutions that "check" all the Verification cards. BTW, I was wrong about how many potential solutions there could be. In the video I say 9, but I think it is only 6. And only four of them when considering T=4. They are: 424, 434, 442, and 443. I consider them all ambiguous. The first two have Sq as the smallest and the last two have Cir as the smallest. Let's consider them one pair at a time. Criteria Cards B, D, and E are true for all of them (No 1s, EVEN > ODD, and they have a pair). Actually, all four also have Criteria A: T=4 in common (assuming that it's correct) The first pair have Criteria C: Sq is smallest. So, this pair "checks" all the boxes; however, there can be only one solution that "checks" all the boxes. The same occurs for the last pair, except in that case Cir is the smallest. So, since all four belong to a group of two or more potential solutions that "check" all the boxes, they are disqualified from being the one and only true solution. That's why I nixed T=4. So, that left only 244 and 344 to consider. And I had to test Criteria A to know for sure. I hope that make sense. I'm pretty sure in some earlier videos I describe ambiguous and actually list out the potential solutions and then cross them out. BTW, thanks for pinpointing the exact time, that was so helpful.

Thanks! I wrote my own program using Python. Unfortunately, before understanding how 'Extreme' and 'Nightmare' modes worked, I just programmed it to play 'Classic' mode.

Thanks for sharing. I really need to practice this skill a bit more.