Having answered all the questions in Game 2 of the June 2007 LSAT, a few final notes:

1)  This game was a bit harder than Game 1. On average, the first game in any section of Logic Games is the easiest, and each subsequent game is harder (sometimes a little harder, sometimes a lot harder) than the last. (This is true on average–occasionally a section will throw you a curveball, but most of the time it’s true. Trust me, I’ve done every section of games that’s ever been released.) This implies two things:

Continue reading ‘June 2007 LSAT, Game 2 Recap’ »

Final question in Game 2 of the June 2007 LSAT. Here’s the basic setup for the game. Question 10 asks “If Limelight is shown exactly three times, Harvest is shown exactly twice, and Greed is shown exactly once, then which one of the following is a complete and accurate list of the films that could be shown on Thursday?”

Since the question is giving me new information, I’m going to answer this one just like I did Question 8 and Question 9–I’m going to make a new diagram.

Continue reading ‘June 2007 LSAT, Game 2, #10’ »

Onward through Game 2 of the June 2007 LSAT.  Last week, I created a setup for the game. Question 9 adds three new rules that apply only for this question: 1) Greed is shown exactly three times; 2) Harvest is shown exactly twice; 3) Limelight is shown exactly once. The question asks “Which one of the following must be true” but I’ll start with the new rules before looking at the answer choices.

Continue reading ‘June 2007 LSAT, Game 2, #9’ »

Let’s continue through Game 2 of the June 2007 LSAT.  Last week, I created a setup for the game and answered questions six and seven. Today we’ll tackle number eight, which says “If Limelight is never shown again during the festival once Greed is shown, then which one of the following is the maximum number of film showings that could occur during the festival?” To me, that’s a pretty nasty question, because it involves a new rule and a lot of potential different scenarios where we’ll have to try to maximize the number of films shown. I’m going to use a bit of intuition here, because I don’t want to waste too much time on any one question.

Continue reading ‘June 2007 LSAT, Game 2, #8’ »

Let’s continue through Game 2 of the June 2007 LSAT.  Yesterday, I created a setup for the game and answered the first question. I answered #6 pretty confidently, but didn’t make all that many inferences in the setup. So I’m still a bit apprehensive–have I missed something? Maybe Question 7 will help me find out.

Continue reading ‘June 2007 LSAT, Game 2, #7’ »

In my last post, I created a setup for Game 2 of the June 2007 LSAT. I didn’t make as much progress as I might have liked, but it just feels like one of those games where you can’t make a lot of inferences. As much as I’d like to make a ton of inferences and predict the answers before I’ve even seen the questions, I don’t think that’s possible here. So I’m going to turn to the questions and see if I can sort them out. This is where the rubber meets the road–I should fairly quickly be able to learn whether I’ve missed something or I’m on the right track.

Continue reading ‘June 2007 LSAT, Game 2, #6’ »

Game 2 of the June 2007 LSAT is a bit different, and a bit more complicated, than Game 1. In that game, all we had to do was put five digits in order. Here, we have to select which things are going to be chosen AND put them in order. It’s not an impossible game, but it’s definitely a step up in complexity.

Continue reading ‘June 2007 LSAT, Game 2 Setup’ »