LG Game 2 Question 9 Explanation
I skipped this question my first time through the game. I eventually came back and solved it by brute force. I drew diagrams disproving all the wrong answers.
This isn’t the best approach, but it works perfectly fine if you have time for it. I did have time on this question since I finished the first game quite quickly.
The short way to solve this question is to have made the deduction that Zimmerman must go at 1pm.
If you know that, then it’s obvious that B is CORRECT. This is because Long always go at 2pm or later (rule 1).
Here are diagrams proving the other answers are possible.
This diagram proves that A is possible:
This diagram proves that C is possible:
This diagram proves that D is possible:
This diagram proves that E is possible:
You don’t need to draw these brute force diagrams. I’m only drawing them in case you thought one of the wrong answers wasn’t possible.
Need help with LG? → Try the LG Mastery Seminar
Solve hard games quickly
Hi, I'm Graeme Blake
I run LSAT Hacks, and I scored a 177 on the LSAT. I teach strategies that let you get questions right, and quickly. I’ve been teaching for over nine years, and have seen everything from score plateaus to test anxiety. I’ve got courses and mastery seminars for people at all levels, and have worked with some of the best LSAT companies around.
---------
Photos and Stuff: Here's my Instagram – Instagram
Fly me somewhere warm or beautiful and I'll give you free tutoring while I'm there 🏝:)
For LSAT 73, Logic Game 2, Question 9 why isn’t the possibility of Zimmerman in the gold room taken into account. It is possible for example to have Z,X,L in gold and the rest in rose. This approach rules 1 and 2 do not apply.
Why would it matter? The point of the diagrams was to eliminate the wrong answers. There’s no need to draw *every* possible scenario.
An easier way than brute force is knowing that Z must be at 1pm. And since M has to be before L, that means M has to be either 1pm or 2pm. That means L has to be 2pm or 3pm. Though this knowledge, one can realize Z and L cannot ever be together, no further deduction made.
And I like that you pointed that out. Realizes Z must be at 1 helps with 9 and 13 and saves so much time with this game. Thanks for the explanations