Diagram

[stackoutawinner]

This game tanked my diagnostic. I was roaring through these and had 10 full minutes to tackle this and couldn't get it done!

After time was called, I continued to time myself and finished this game at over 16 minutes!!! (ouch) I spent just over 7 minutes on the set up (some of that extra time allowed me to answer question 23 - but after the buzzer)

I found the game to be a monster hybrid of binary grouping and numbered ordering (more of the former than the later)

The two questions, specifically, that gave me trouble were 21 & 22. I think my diagramming was off somewhere, and it took me too long to set this up, perhaps because I was finding inferences as I drew the contraints onto the binary diagram.

Would someone care to give me their approach?

[ManhattanPrepLSAT2]

Hey Stacks,

I'm happy to write up a solution, but I figure I'll give you one more crack at this before I do so --

What I would do is set up a simple closed board logic chain for the first three constraints, which can be diagrammed easily enough, and then write the final two constraints, which are, as you said, very unusual for a b.g. game -- off to the side.

Sometimes, I think that coming up with creative ways to diagram unexpected constraints is more trouble than it's worth, and it's best just to write things out.

I believe (and I could be wrong) that getting too lost in your work may have impacted how you looked at, for example, #21. This could, I imagine, be a killer q to try to answer off a creative diagram, but it's actually directly related to a constraint -- X cannot play on the fifth Sunday unless R plays on the first, and, according to the constraints for this problem, R can't play first.

22 is based off a pretty simple conditional chain as well -- If O is first, J cannot be selected... I'll leave you to figure out the rest.

Sorry that I didn't just post a complete solution -- I have a feeling, stacks, that you would prefer to figure it out on your own with a little guidance -- if you are still stuck, or frustrated with this game and just want answers(!), I'm happy to write up a complete solution for you.

[stacksdoe]

Wow, no body wants a piece of this game, it's clearly the hardest one out of the four.
Here is the diagram and the rules I utilized:

--- --- --- --- --- --- / X/Z ---- ---- ----
1 2 3 4 5 6 / 4out
X<--/--> Z (this means they both can not be selected)
X<--/-->P (this means they both can not be selected)
-J ---> -N---> YPZHK
M----> +
-O

J
+----> J < O
O

X5th---->N/O1st
[Y] (means Y must be selected)

[stacksdoe]

THat last post didn't come our correct: the 4 out should be under the 4 slots!

If anyone is got questions or concerns about the six questions, please post. One you transcribe the rules, make a few inferences, which I have shown, the questions are a piece of cake!

[BarbC178]

I am also looking for some guidance with this game.

Totally doable with mpreps diagramming... only thing is I ended up with 3 diagrams: logic chain, in/out T chart, 3D number line... + those side rules with an asterix.

Long story short... it took me about eight years to draw all this... not much time for questions. Is there a simpler way?

I tried it again with a rule chart instead of a logic chain and didn't speed things up.

I almost think no diagram and chug and plug would have been faster!

Thanks!

Barb

[Laura Damone]

Hi! How did you arrange your diagrams? I did a subdivided logic chain, atop a subdivided T-chart, atop a numberline (not 3D, since the rest were subdivided and all I really needed to do was represent the fact that there is an ordering component in this mutant hybrid). It ended up being clean and easy to work with. It took a while to setup, for sure, and the game ended up taking me around 11 minutes. About 4.5 was spent wrangling the set-up, and the Orientation question bogged me down. 20 and 21 were straightforward, as were 23 and 24. 22 was a toughy which in retrospect should have been easier than it was.

I'll also say that I think this game is very old-school and not likely something we'll see on future tests. The "super hard game setup with really easy questions" is less common now than on tests of old, and that's a fitting description for this one, I think. The placeholder and limited group space inferences are important. They prove that Y must be in and answer 22 (b/c O1 --> Jout --> H + K in).

Here's my scratchwork. Hope this helps! https://docs.google.com/document/d/1roi ... sp=sharing

[BarbC178]

Hi Laura!

Thanks for the scratchwork!

Mine was not that different from yours except my number line was on top, subdivided logic chain under that, a subdivided T Chart to the right + the conditional rules. Also, I add anti-chunk boxes of the things that cannot go together.

I wasn't super efficient as I ended up drawing another number line/chart underneath the logic chain work out the Qs.

And my eyes kept on having to dart between diagrams to keep it all straight!

I got that Y had to be in and the questions themselves were not bad.

I like that you subdivided your number line into composers, to not worry as much about the order at that point. I had my out-group laid out like that, but not the in-group. Yours is much easier to read!

Good news that it doesn't seem like something I'll see on future tests. A serious time suck!

Thank you as always!

- Barb

Hi! How did you arrange your diagrams? I did a subdivided logic chain, atop a subdivided T-chart, atop a numberline (not 3D, since the rest were subdivided and all I really needed to do was represent the fact that there is an ordering component in this mutant hybrid). It ended up being clean and easy to work with. It took a while to setup, for sure, and the game ended up taking me around 11 minutes. About 4.5 was spent wrangling the set-up, and the Orientation question bogged me down. 20 and 21 were straightforward, as were 23 and 24. 22 was a toughy which in retrospect should have been easier than it was.

I'll also say that I think this game is very old-school and not likely something we'll see on future tests. The "super hard game setup with really easy questions" is less common now than on tests of old, and that's a fitting description for this one, I think. The placeholder and limited group space inferences are important. They prove that Y must be in and answer 22 (b/c O1 --> Jout --> H + K in).

Here's my scratchwork. Hope this helps! https://docs.google.com/document/d/1roi ... sp=sharing