Diagram

[joshua.abram]

It's the graduation/car game.
How would you set this up?

[ManhattanPrepLSAT2]

hey josh --

this is a 3-d numbered ordering game. i've attached a diagram with the first constraint filled in -- see if u can fill in the rest!

[nneamakaeze]

mike can you please fill in the rest of the diagram? im having some trouble with it. thanks!

[ManhattanPrepLSAT2]

here you go -- let me know if you have any questions!

MK

[nneamakaeze]

thanks for the prompt reply! However, I cannot seem to figure out how you came about the inference that S and T could not have bought a car in 1993

[ManhattanPrepLSAT2]

S and T cannot buy cars in '93 for two different reasons --

When we combine the constraints, we get a string of relative relationships (notated off to the side of the diagram).

what we know is that

S gets a car in a year before
R and G graduate, which has to be before
T graduates, which must be before
T buys a car.

The latest, imagine, that T could buy a car would be 95, so the latest T could graduate is 94, so the latest R and G can graduate is 93. Therefore, the latest S can get a car is 92.

Similarly, imagine, the earliest S can get a car is 91. Therefore, the earliest R and G can graduate is 92, an the earliest T can graduate is 93. Therefore, the earliest T can buy a car is 94.

Let me know if you have any more questions!

MK

[ManhattanPrepLSAT1]

I built this setup a few days ago and thought it might be useful to throw up here.

[ryanmatch]

I really like Mike's setup for this game. I don't know why yet, but this game and the alphabet soup game totally killed me. I thought this logic games section was way harder than normal, but according to some other sources I read, this was a below average difficulty section? Strange.

[noah]

It may be that certain game types throw you for a loop. Perhaps it's 3-D ordering games? If so, that's a good thing to know and attack head-on.

[dan]

Here's another solution to Game 3. Let me know if you have any questions!

[fyami001]

Hi Dan,
in the solution you have posted, I can't understand your fourth inference. Why is that the earliest Sue could graduate be in 1993? Why couldn't she graduate in 1992?

If this is discussed in one of the earlier posts, I tried to see where Mike and Matt posted their solutions, but I can't find how to download the solutions.

Also, can we put an "X" on the year 1995 as a graduation date?

Thanks in advance.

[ManhattanPrepLSAT1]

Hi fyami001,

I just went back and took a look at Dan's solution. I think it was a case of having it the other way around. I think he meant that the latest Sue could graduate is 1993. You're absolutely correct that Sue could graduate in 1992.

Also, can we put an "X" on the year 1995 as a graduation date?

We absolutely can. In fact, I've gone back and reposted the setup that I used to work through this game. I created two frames based around the fork in the road that either R and S would graduate in 1993 or T would. In both frames no one graduates in either 1991 or 1995.

Hope you find the solution I reposted useful, and of course let me know if you haven any further questions!

[Carlystern]

I built this setup a few days ago and thought it might be useful to throw up here.

I was freaking out when I came to question 13, but then I realized we haven't placed Rc in the diagram and it should be off to the side! Break through for me since I'm not easily hip to notice details, which is ironic.

C

[stacksdoe]

Hello All,

I know some of the posts are from a distant past, however, for anyone else out there still chucking like me, here is some cool advice about this game.
My initial set-up also held the information in a stacked aspect, two slots from 1-5. However, the problem with that is, it conveys the idea that for each slot they'll be two variables, which is not the case. So I thought, maybe we could do 3 slots one for each variable, in the following manner:

___ ___ ___ ___ ___ R
___ ___ ___ ___ ___ S
_/_ _/__ ____ ___ T
* I couldn't line up the T row with this program.i.e. T should up line up as as R and S are
*For the above diagram, you will need to X out slots that may not be used, as I have shown with T (In any scenario T most graduate in 93 or 94 and buy his/her first car in 94 or 95)
In this way, each variable has its own row (still applying subscripts Rc, Sc, Tc,) and when rules are applied it doesn't allow any misreads. If we only needed one master diagram, this might be the best option, but we need templates- as pointed by fellow posters- the complexity of the diagram and the time element confounds this set-up. You could still use it-I'm sure for some people its the best option-and reach the right solutions quite easily, but it is not the most efficient. The most efficient set-up needs to remain linear with no stacks, because on any given year we could zero variables (except for slot 3). If you would like me to demonstrate please ask, and I'll attach my two templates, which are faster to complete and easier to read (at least for me)

JT