56 Game 3
Comments


So is the first rule the reason that there can't be multiple types of trees in each park? That part went over my head and the number of possibilities paralyzed me :(

So this is the first binary grouping game I've seen where the notation for the right-hand column is not negated terms (the usual format being: G on the left and not-G on the right). This is helpful since, if we used the typical format, we might run into trouble applying rule 3 (mistakenly thinking that within group not-G, if we had not-T then we would have not-O).
So two questions: 1) Am I right in thinking that the usual right-hand negative notation format would get us into trouble? And more importantly, 2) in the interest of making games as mechanical as possible, what features of this game tipped you off that it would be more strategic to leave the right-hand column un-negated?

Ah, totally! In other words, you spotted that group membership isn't mutually exclusive here.
Very helpful, thanks!

I see what bcarmack was saying—I made this one WAY more difficult than it needed to be because I didn't realize that "Each of the parks is planted with exactly three of the varieties" meant "Hey, there's only three on each side." I thought it meant you have to have AT LEAST three of the four, but you could have, I guess, an infinite number on either side.
What made it clear we were only dealing with three spaces on each side? Rule 1?

Dave I don't understand question 14-(A). you drew (1) G: T/ S/ M L: S/ O /T and (2) G: T/ S/ M L: S/ M/ T. I did same thing concerning (1) but I don't know why the answer choice (a) also means (2). I thought the number of the parks planted with maples is 2 and the number of the parks planted with oaks is 0, so it's not equal.
*** I solve this question today; having relaxing time. There isn't delete button, so I put comment here