In the setup, I wrote three principles for this game:
- The first person will choose their first choice. Start from there.
- Someone going 2nd will never get worse than their second choice. Likewise, 3rd will never get worse than their third choice.
- So, on average someone chosen, say, 3rd, will get their 3rd choice or better.
That lets you eliminate some answers. B, D, and E are out. At most one person will get their fourth choice: the rest will have a better choice available. Same with third. At least two people will get the chance to choose their 1st or 2nd choice.
C is impossible if you count. The second choices are X, Y and Z. But everyone has X or Y as a first choice, so someone will choose X or Y first. That only leaves two second choices left: one of X/Y and Z. So there aren’t enough for three people to get their second choice.
A is CORRECT. Here’s a scenario that show’s it’s possible. Note that I did not draw this on my page. This is just a way to represent the information to make it clearer for the explanation.
Want a free Logic Games lesson?
Get a free sample of the Logic Games Mastery Seminar. Learn tips for going faster at logic games
Ann says
In the diagram for answer choice A, shouldn’t Torillo pick third and Larabee pick fourth? Thanks for your help!
TutorRosalie (LSATHacks) says
Hi! Not sure if I’m understanding correctly. Answer Choice A is saying that 2 employees each pick their third choice. The diagram above lists out the order of preference, not the order in which they chose. So it doesn’t matter if T chooses 3rd or L chooses 4th: they both get their third choice.
JB B says
For #15, you put L is going third, and Z is still available, wouldn’t L be obligated to choose Z because of the third rule?
Jasmine says
Hi there,
Firstly, I want to say that you are amazing and ever so helpful :) my LSAT score definitely has you to thank.
Secondly, you state that A, D, & E are out right away, but I think you meant to say that B, D, & E are out :)
TutorLucas (LSAT Hacks) says
Yes, thanks for catching that! The page has been updated.