Diagram

[ManhattanPrepLSAT2]

This game came up in another discussion (maximum-minimum-questions-on-logic-games-t426.html)

So I though I would post a diagram of it here. Hope it's helpful.

Step 1 represents the basic skeleton with no inferences
Step 2 is a simple representation of the constraints
Step 3 includes inferences about specific assignments and the # of assignments (try to see how we got them all!)

[andrewgong01]

I did this game exactly opposite of what was what posted. I viewed the the groups being FHPS and then the elements as the people who get repeated. I thought this would lead to more numerical inferences because we know from Rule 1 each group, FHPS, can only have up to 3 people since each person can buy at most 1. Rule 7 allows us to deduce that no groups can have all 3 people. Rule 6 creates two slashes for the P group. Rule 3 tells us to put a box around hot dob and pretzel. But during set up I did contemplate changing the groups because this game seemed flexible

The final game board




X X x X
_ _ X __
_ _ M M
F H P S

X-====> "/" [Slash mark]


By this set up we can also represent the M/N rule as an antichunck and then draw dots over hotdogs and shish kebabs to represent the rule that if you buy S you can not buy H. Also note that the first spot in H should be "L/N"



To me I think this grouping method makes the game easier to solve because it almost solves the whole game and it is a matter of just filling in some slots . I was able to solve the game using this game board in about 6.5 mins