Sorry, busy and won’t submit (or possibly guess) until later, but just in case it matters to what I do, should we now at this point how many verifiers everyone has used after round 2?
No, I’ll report that out after everyone has submitted for round 2. Actual gameplay is simultaneous, so you don’t really know what others are doing until the pause at the end.
I didn’t quote those earlier posts before, but doesn’t “All 3 submission received and responded to” refer to round 2 submissions, which means everyone has submitted for round 2? Having never played IRL, this is all new to me.
Oh, yes. Sorry. Every one is at 6 verifiers used.
Ready for round 3
Sorry for the delay, been driving and then had a meeting.
Attempt to solve sent.
now_samantha has successfully solved the code as 3-1-4!
Because I’m pulling from the game itself, if she wants to explain her solve I will let her do that, otherwise I’ll pull something together tonight or over the weekend when I have time to figure out what the verifiers were testing. 
Happy to explain, equally happy to let the other 2 plug away until they figure it out too.
oh man, good for you! I don’t think I was too far away, but I was probably going to need one or two more rounds. My next round I was going to send 413 through.
I knew that there were no numbers in sequence, the sum was a multiple of 4, and that Blue had to be bigger than one of the other numbers (wasn’t sure which one yet).
I had no clue. I thought I had a solution, but even before seeing the answer I realized the solution was wrong. I was in the process of working out what I did wrong.
Congratulations, now_samantha, and thanks for the game MH. (That’s thanks for the first game, I hope.)
I hadn’t been nearly confident enough of the tentative solution to make it a guess, though I wondered if I should make it a guess on the basis that MH said the game usually ended in 3 rounds, so without a guess there was a good chance I was losing anyway.
The likelihood of ending in 3 rounds must depend on the number of players, so I assumed fair chance it wouldn’t.
The board game is for 1-4 players, so 3p isn’t that low of a count. The limit is primarily due to the count of the components though, there is no practical limi.
Some of the possible verifiers are more ambiguous, which makes the game last longer. Not immediately seeing examples of that.
Since there doesn’t seem to be a call to play on, this was my thought process:
Verifier B: (sum is 3x, 4x, or 5x). As none of the other verifiers references specific values of the colors, just relative values, the other verifiers are unaffected by adding or subtracting 1 from all numbers. That doesn’t change the value mod 3, so it is almost impossible for the verifier to test for the sum equalling 3x. (You could have 1, 3, 5 in some order). So most likely verifier B is for the sum to be 4x or 5x.
Verifier A: Assuming verifier B is for the sum to be 4x or 5x, we probably don’t have 3 numbers in sequence (could have 345 or 543 if B is testing for equalling 4x). So most likely Verifier A is either testing for 0 sequences or 2 sequences.
Verifier C and D relationship I think was cool, will get to later b/c I didn’t think about C and D much at first, guessed 341 in round 1, tested verifiers A, B, and D. That gave me a yes on sum is 4x, no on a sequence of 2, and no on D, so most likely have no sequences.
The combination of sum is 4x and either 0 or 3 sequences, and don’t have (B < Y) intersect (B > P) reduces things down to very few possibilities. I think 12.
I’ve deleted my scratch work, but that 12 actually gets reduced to 6 with a cool interaction between verifiers C and D that was the motivation for my rule question. If verifier C is that B is the unique minimum, then verifier D is redundant as B < Y and B < P. So that’s not possible. Likewise, verifier C can’t be that B is the unique max. So we can rule out cases in which B is the min and the other two are tied for the max, and likewise when B is max and the other two are tied for the min. I’ve only played a few times, but have never seen something like that and think it’s neat.
So of my 6, I worked out that 413 would identify the answer, tested A, C, D. Confirmed that there were 0 sequences, D was yes so confirmed that that verifier is B > Y, and C was no, so know that C isn’t Y is minimum. Since D is B > Y, and verifier C can’t refer to B, then Verifier C must refer to P. Of my possibilities, that left 314 as the unique solution, so verifier A is yes if 0 sequences, B is yes if sum is 4x, C is yes if purple is max, and D is yes if blue < yellow.
Wow, go you. You definitely found some relationships between the modifiers that I totally missed. Good job!
Interest in a round 2? I can do a similar game with the 4 verifiers. The online book also has puzzles with 5 and 6 verifiers, but those will be harder so waiting until people get their feet under them with the system makes sense.
I’m a little busier at work this week, but if there is interest I can start it up tonight or tomorrow.
I would play again. This didn’t really take a lot of time on my end (probably should have taken more so I had a better chance at winning).
I wouldn’t mind if next time you waited to reveal the answer so we could get a 2nd and 3rd place, but mostly I am just curious how long it would have taken me to figure it out myself.
1 Like
Sure, I can do that.
1 Like
In
1 Like
In
1 Like