Every Logic Games section has exactly 4 games, each with 5-7 associated questions. In total, the Logic Games section accounts for 22-23 questions of the 99-101 scored questions appearing on any LSAT exam.

Game Types

Three Organizational Schemes
We will spend a good amount of time later on in this book analyzing the specific details of the different game types that you will be responsible for on your exam. For now, it's important to know that almost every logic game will ask you to organize elements in one of the following three ways:

1. Ordering:
Your task is to order a set of individual elements.

INSERT IMAGE

2. Binary Grouping:
Your task is to put elements into one of two distinct groups.

INSERT IMAGE

3. Assignment:
Your task is to assign elements to three or more categories.

INSERT IMAGE

 Breakdown of Game Types
Within the three organizational schemes outlined above there are a number of specific game types:

INSERT COMPLEX TABLE

The percentages listed above give an indication of how prevalent each of the game types has been since the October 2000 exam.

Warning!
Later on in this book, we will carefully examine each and every game type, and we will introduce the most efficient and effective methods for tackling each game type. It is worth noting, however, that the data in the table above represent tendencies, NOT absolutes. In other words, not every game will fall neatly into one of these boxes.

One of the keys to Logic Games success is flexibility. If you become a strict "executor" of the recommended strategies and approaches, you will have a harder time mastering the Logic Games section than, say, someone who is able to adapt his or her knowledge, skills, and methodologies to novel situations.

From Here to 170+

The Logic Games Dichotomy
Flexibility is just one of the characteristics that separates the high-scorer from the average test-taker. Let's consider some of the others. When it comes to Logic Games, there is a big difference between the approaches, skills, and attitudes of the average scorer and the top scorer:

Bridging the Gap
So, how do you move from the left column to the right?

Strengthen your game recognition skills
It is important to be able to recognize the common characteristics associated with each game type. Quick game recognition allows you to choose the most effective setup for the game at hand.

Strengthen your setup skills
Once you've recognized the game type, you must be able to diagram the game comfortably and quickly. Your setup/diagram will serve as your main tool for making inferences and answering the questions.

Strengthen your inference skills
Making valid inferences is the key to Logic Games success. Through study and practice, you will begin to see the types of inferences that are common to each of the game types.

Learn to allocate time wisely
Some games require more setup time than others. It's important to get a sense for when it's worth it to spend a bit of extra time on the setup and when it's not.

Learn question-specific approaches
It is important to be able to recognize the common question types and to be proficient in the specific approaches best suited for each.

The next chapter will cover our first game type, Relative Ordering. Let's get to it.

Truth and Plethora both perform at some time before Orbit.
Simpleton performs at some time before Rewind.
Truth performs at some time before Nonesuch.
Victim performs at some time after Simpleton.
Moonshot performs at some time before Victim but at some time after Orbit.

INSERT IMAGE

Different Versions of the Same Relationships
As you draw your own Tree diagrams and compare them with those in this book, you may sometimes note slight orientation differences between your version and the solution. This is okay as long as the horizontal solid line connections between the letters are the same in both diagrams. Here's an example to illustrate:

INSERT IMAGES

Note that Diagram 1 and Diagram 2 look very different at first glance. Don't be fooled; they actually represent the same relationships. In both diagrams, T has exactly two connections: N is after T and O is after T. Similarly, V has exactly two connections in both diagrams: M is before V and S is before V. Upon close examination, you will see that all the connections are exactly the same from one diagram to the other. In short, it is the horizontal (from left to right) connections between and among letters that are important, not the vertical (up and down) orientation of the letters. So, when you check the validity of your Tree diagrams, be sure to check these horizontal connections and NOT the overall shape of the picture.

The completed Tree diagram consolidates the information from all the constraints and gives us a clear picture of the relationships between and among the elements. We will unlock the power of The Tree momentarily when we discuss how to draw inferences from the diagram in order to answer questions. First, let's get more comfortable with the setup process by drilling the mechanics. 

DRILL IT: Tree Setup Mechanics

Instructions
Each mini-drill will contain one or more constraints. Your task is to construct a Tree diagram for each mini-drill. Be sure to check your diagram against the solution on the next page AFTER EACH AND EVERY PROBLEM. Make sure you understand it before moving on to the next exercise.

Example: O departs at some time before P.

INSERT IMAGE

1. J leaves at some time before K but after L.

2. Both R and S arrive earlier than Q.

3. K presents earlier than both M and N.
 K presents later than G.

4. X is built later than Y but earlier than Z.
 W is built later than Y.

5. B interviews at some time before F.
 Both D and G interview at some time before B.
 H interviews at some time after D.

6. H and J both speak at some time before N.
 K speaks at some time after P.
 P speaks at some time before H.

7. X plays earlier than W but later than T.
 Y plays later than Z.
 Z plays earlier than X.

8. Both M and H are written later than N.
 J is written earlier than K.
 K is written earlier than N.
 O is written at some time before H but after J.

9. Both T and V call at some time before M.
 N calls at some time after R.
 O calls at some time before N but after M.
 P calls at some time before M.
 T calls at some time before S.

10. M arrives at some time after O.
 L arrives earlier than N
 J arrives a at some time after L but before P.
 S arrives at some time after J.
 N arrives later than O.

11. Both S and Y finish at some time before R.
 T finishes at some time after X.
 S finishes at some time after W but before V.
 X finishes later than S.
 Y finishes later than W.

12. K is produced at some time after N but before O.
 Both L and J are produced at some time before N.
 M is produced at some time after P.
 R is produced at some time before O.
 J is produced at some time before M.

SOLUTIONS: Tree Setup Mechanics

Example: O departs at some time before P.

INSERT IMAGE

1. J leaves at some time before K but after L.

INSERT IMAGE

2. Both R and S arrive earlier than Q.

INSERT IMAGE

3. K presents earlier than both M and N.
 K presents later than G.

INSERT IMAGE

4. X is built later than Y but earlier than Z.
 W is built later than Y.

INSERT IMAGE

5. B interviews at some time before F.
 Both D and G interview at some time before B.
 H interviews at some time after D.

INSERT IMAGE

6. H and J both speak at some time before N.
 K speaks at some time after P.
 P speaks at some time before H.

INSERT IMAGE

7. X plays earlier than W but later than T.
 Y plays later than Z.
 Z plays earlier than X.

INSERT IMAGE

8. Both M and H are written later than N.
 J is written earlier than K.
 K is written earlier than N.
 O is written at some time before H but after J.

INSERT IMAGE

9. Both T and V call at some time before M.
 N calls at some time after R.
 O calls at some time before N but after M.
 P calls at some time before M.
 T calls at some time before S.

INSERT IMAGE

10. M arrives at some time after O.
 L arrives earlier than N
 J arrives a at some time after L but before P.
 S arrives at some time after J.
 N arrives later than O.

INSERT IMAGE

11. Both S and Y finish at some time before R.
 T finishes at some time after X.
 S finishes at some time after W but before V.
 X finishes later than S.
 Y finishes later than W.

INSERT IMAGE

12. K is produced at some time after N but before O.
 Both L and J are produced at some time before N.
 M is produced at some time after P.
 R is produced at some time before O.
 J is produced at some time before M.

INSERT IMAGE

Time Allocation

Setup Time vs. Question Time
In Chapter 1, we briefly discussed the importance of wise time allocation. On some games, you will do yourself a favor by spending more time on the setup, while on others you will be better served by moving to the questions sooner:

Front-loaded pacing plan (most extreme case):
INSERT IMAGE

Back-loaded pacing plan (most extreme case):
INSERT IMAGE

As you were drilling your Tree mechanics, you may have noticed that the Tree setup is not very time intensive (assuming you can execute the mechanics without too much trouble). Generally speaking, the Tree setup should take about 1 minute to complete, leaving you with plenty of time to tackle the questions. The good news is that once you have your completed Tree down on paper, you've basically "solved" the game. Answering the questions becomes an exercise in reading the Tree (as we'll see momentarily).

Strategically speaking, you should aim to complete your Tree setup in about 1 minute. You should be finished with the entire game (reading the scenario and constraints, setting up the Tree, and answering all the questions) in about 5-7 minutes, depending on the number of questions. Relative Ordering games represent an opportunity to put time in the bank, or to make up time if you've fallen behind.

These are obviously guidelines and not absolutes. Your own pacing will depend on your comfort level and your skill level. We've discussed and drilled the setup skills; now we'll learn how to read The Tree to make inferences and answer questions.

Inferences: Reading The Tree

Two Rules
By properly setting up your Tree diagram, you are in essence uncovering and relating all of the key inferences required to answer the questions. Your ability to utilize these inferences, however, depends on your ability to correctly read The Tree. There are two important rules that you must keep in mind. We'll discuss these rules one at a time using our completed Tree diagram from our rock band example.

 INSERT IMAGE

RULE #1: The relative position between two elements, or letters, can be determined if you can trace a continuous path between these two elements without changing the horizontal direction of your path.

Example: P to V
Starting at P, we can follow a solid line to the right towards O, continue to the right towards M, and again trace to the right to arrive at V. Note that we have traced a continuous path from P to V, and we did not have to change horizontal directions to do so (we moved to the right the entire time). Thus, the position of P relative to V is known. Even though the constraints never referenced a direct relationship between the two, we can infer that P sits somewhere before V (with at least O and M between them).

Example: M to T
From M, we can follow a solid line to the left towards O, then continue on a solid line to the left arriving at T. Thus, we can conclude that T sits somewhere before M.

RULE #2: The relative position between two elements, or letters, cannot be determined if the path between the two letters includes one or more changes in horizontal direction.

Example: N to O
From N, we can follow a solid line to the left towards T, but then we must change horizontal directions, moving back to the right to arrive at O. Thus, the position of N relative to O cannot be determined. N could come somewhere before O, but it could also come somewhere after O.

Example: P to R
This is a tough one. It looks like P comes before R, but the relationship between them is actually unknown. Remember, the Tree is a map of relative position, NOT a physical picture of order. From P, we can follow continuous, solid lines to the right towards V, but then we must change horizontal directions back to the left towards S, and then change again to move right towards R. Thus, the position of P relative to R cannot be determined. P could come somewhere before R, but it could also come somewhere after R. Keep in mind that the up and down direction of our traced path is unimportant.

The Key to Tree Success: Reading the "Floaters"
"Floaters" are defined as diagram elements, or letters, that have a known position relative to only one other letter. For example, in our diagram above, N comes somewhere after T, but that's all we know about N. Similarly, R comes somewhere after S, but that's all we know about R.  Floaters are the most flexible of the elements because they can fit into the order at just about any position. Getting questions right will depend on your ability to recognize the floaters and manage the uncertainty of their positions. Visually, you can usually spot floaters because they tend to float, or hang, off the diagram like branches, only indirectly connected to the central trunk of the Tree diagram. Let's get some practice applying the rules and reading floaters.
 

DRILL IT: Reading The Tree

Instructions
Each mini-drill will contain a completed Tree diagram. Your task is to answer the associated questions based on your understanding of the diagram. Be sure to check your answers against the solutions AFTER EACH SET OF QUESTIONS. Make sure you understand before moving on to the next exercise.

Exercise #1:
INSERT IMAGE

1. Does V come somewhere before O? Yes, no, or maybe?

2. Does T come somewhere before R? Yes, no, or maybe?

3. How many letters must come after P?

4. Of the eight letters, which ones could occupy the eighth position?

5. Of the eight letters, which ones could occupy the first position?

6. What is the earliest position that O could occupy?


Exercise #2:
INSERT IMAGE

1. Does M come somewhere before R? Yes, no, or maybe?

2. Does K come somewhere before J? Yes, no, or maybe?

3. How many letters must come before O?

4. Of the eight letters, which ones could occupy the eighth position?

5. Of the eight letters, which ones could occupy the first position?

6. If N occupies the third position, what is the earliest position that M could occupy?



DRILL IT: Reading The Tree (Continued)

Exercise #3:
INSERT IMAGE

1. Of the seven letters, which ones could occupy the first position?

2. Of the seven letters, which ones could occupy the last position?

3. How many letters must come before J?

4. How many letters must come after L?

5. What is the latest position that O could occupy?

6. If J occupies the third position, list all of the possible positions that N could occupy. 

Exercise #4:
INSERT IMAGE

1. What is the earliest position that R could occupy?

2. What is the earliest position that T could occupy?

3. If V occupies the third position, what is the earliest position that R could occupy?

4. What is the latest position that S could occupy?

5. If Y occupies the second position and V occupies the fourth position, how many different possibilities are there for the ordering of the seven letters? Write them out.

6. If T occupies the fourth position, which letters could occupy the seventh position?



SOLUTIONS: Reading The Tree

Exercise #1:
INSERT IMAGE

1. Does V come somewhere before O? Yes, no, or maybe? YES

We can trace a solid line from V to M to O without changing horizontal directions.

2. Does T come somewhere before R? Yes, no, or maybe? MAYBE

From T, we can trace a solid line all the way to N without changing directions, but then we must move back to the left in order to arrive at R. Thus, we cannot determine the position of T relative to R. T could come before R or after R.

3. How many letters must come after P? THREE

Moving to the right, we can trace a continuous connection between P and M, P and O, and P and N. Thus, M, N, and O must all come after P. Remember, R is a floater! It could potentially come before P.

4. Of the eight letters, which ones could occupy the eighth position? N, S

Remember that S is a floater! The only thing we know about S is that it must come after T. Other than that, S is free to occupy any position, including the eighth position.

5. Of the eight letters, which ones could occupy the first position? T, P, V, R

Remember that R is a floater! The only thing we know about R is that it must precede N. Other than that, R is free to occupy any position, including the first position.

6. What is the earliest position that O could occupy? 5TH

Notice that T, P, V, and M must all come before O. If these four letters must precede O, then the fifth position is the earliest position that O could occupy. 

SOLUTIONS: Reading The Tree (Continued)

Example #2:
INSERT IMAGE

1. Does M come somewhere before R? Yes, no, or maybe? MAYBE

Tracing the path from M to R involves changing directions twice. Thus, the position of M relative to R cannot be determined. M could come before or after R.

2. Does K come somewhere before J? Yes, no, or maybe? NO

From J, we can trace a continuous path to the right to arrive at K. Thus, K comes after J, not before.

3. How many letters must come before O? FIVE

R, K, N, L, and J can all be traced back to O on a continuous, one-directional path.

4. Of the eight letters, which ones could occupy the eighth position? O, M

In this case, M functions somewhat like a floater. We know that M must be preceded by both J and P. Other than that, however, M is free to occupy any position, including the last position.

5. Of the eight letters, which ones could occupy the first position? L, J, P, R

Don't forget about the floater R! We know that R must come before O. Other than that, however, R is free to occupy any position, including the first.

6. If N occupies the third position, what is the earliest position that M could occupy? 5TH

If N occupies the third position, L and J must occupy the first and second positions (not necessarily in that order). We know that P must come before M. With the first three positions filled, the earliest that P could come is fourth. Thus, the fifth position is the earliest position that M could occupy.

SOLUTIONS: Reading The Tree (Continued)

Example #3:
INSERT IMAGE

1. Of the seven letters, which ones could occupy the first position? O, L

Every other letter has at least one letter that must precede it.

2. Of the seven letters, which ones could occupy the last position? P, S, M, N

Watch out for the floater M! Also note that N functions somewhat like a floater in this case. We know that O and L must precede N. Other than that, however, N is free to occupy any position, including the last.

3. How many letters must come before J? ONE

L must come before J, and P and S must come after J. J's relationship with O, N, and M is uncertain because we cannot trace a one-directional line between J and O, J and N, or J and M. 

4. How many letters must come after L? FOUR

N, J, P, and S must all come after L. L's relationship with O and M is uncertain because we cannot trace a one-directional line between L and O or L and M.

5. What is the latest possible position that O could occupy? 5TH

All we know about O is that both M and N must come after it. Thus, O cannot occupy the sixth or seventh positions, but it could occupy the fifth position.

6. If J occupies the third position, list all of the possible positions that N could occupy. 4TH, 5TH 6TH, 7TH

If J occupies the third position, L and O must occupy the first and second positions (not necessarily in that order). This leaves the fourth, fifth, sixth, and seventh positions for M, N, P, and S. Since there is no one-directional connection between any of these four letters, their relative positioning is uncertain. Thus, N could occupy any one of the last four positions.
 

SOLUTIONS: Reading The Tree (Continued)

Example #4:
INSERT IMAGE

1. What is the earliest position that R could occupy? 4TH

S, Y, and W must all come before R.

2. What is the earliest position that T could occupy? 4TH

X, S, and W must all come before T.

3. If V occupies the third position, what is the earliest position that R could occupy? 5TH

If V occupies the third position, W and S must occupy the first and second positions, respectively. Y must come before R. With the first three positions filled, the fourth position is the earliest that Y could occupy. R could occupy the fifth position immediately after Y.

4. What is the latest possible position that S could occupy? 3RD

X, T, V, and R must all come after S. Thus, the latest position that S could occupy is the third.

5. If Y occupies the second position and V occupies the fourth position, how many different possibilities are there for the ordering of the seven letters? Write them out.

W Y S V R X T
W Y S V X R T
W Y S V X T R

If Y occupies the second position and V occupies the fourth position, S must occupy the third position.

6. If T occupies the fourth position, which letters could occupy the seventh position? V, R

If T occupies the fourth position, W, S, and X must occupy the first, second and third positions, respectively. This leaves V, R, and Y for the last three positions. Y must come before R, so Y can't occupy the last position. 

Applying The Tree

Try It Again
Now that you've learned how to draw inferences from the Tree diagram, it's time to put your skills to good use. Let's revisit the rock band game introduced at the start of the chapter. Try developing your Tree from scratch, and then use it to tackle the questions. Again, limit yourself to 8 minutes. We'll work through the solutions together on the pages to come.

Exactly eight rock bands--Moonshot, Nonesuch, Orbit, Plethora, Rewind, Simpleton, Truth, and Victim--perform consecutively at a showcase on Friday night. No band performs more than once, and no two bands perform simultaneously. The following conditions apply:

Truth and Plethora both perform at some time before Orbit.
Simpleton performs at some time before Rewind.
Truth performs at some time before Nonesuch.
Victim performs at some time after Simpleton.
Moonshot performs at some time before Victim and at some time after Orbit.

1. Which of the following could be the order of the performances from first to last?

(A) Plethora, Truth, Orbit, Moonshot, Rewind, Simpleton, Victim, Nonesuch
(B) Truth, Nonesuch, Moonshot, Plethora, Simpleton, Orbit, Victim, Rewind
(C) Plethora, Truth, Nonesuch, Orbit, Moonshot, Victim, Simpleton, Rewind
(D) Truth, Plethora, Nonesuch, Orbit, Simpleton, Moonshot, Victim, Rewind
(E) Truth, Nonesuch, Orbit, Simpleton, Plethora, Rewind, Moonshot, Victim

2. Which one of the following must be true?

(A) At least four bands perform at some time after Plethora.
(B) At least four bands perform at some time after Truth.
(C) At least two bands perform at some time after Moonshot.
(D) At least two bands perform at some time before Nonesuch.
(E) At least two bands perform at some time before Rewind.

3. If Plethora performs fifth, then each of the following could be true EXCEPT:

(A) Rewind is the sixth band to perform.
(B) Nonesuch is the fourth band to perform.
(C) Simpleton is the second band to perform.
(D) Truth is the third band to perform.
(E) Rewind performs at some time before Nonesuch but at some time after Truth.

4. If Moonshot performs fourth, then which one of the following must be true?

(A) Victim is the sixth band to perform.
(B) Truth performs earlier than Plethora.
(C) Nonesuch performs earlier than Victim.
(D) Simpleton performs earlier than Nonesuch.
(E) Simpleton performs later than Orbit.

5. Each of the following could be true EXCEPT:

(A) Victim performs earlier than Nonesuch.
(B) Rewind performs earlier than Truth.
(C) Nonesuch performs earlier than Plethora.
(D) Simpleton performs later than Orbit.
(E) Moonshot performs earlier than Plethora.

6. If the condition that Victim performs at some time after Simpleton is replaced with the condition that Victim performs at some time before Simpleton, and if all other conditions remain in effect, then which of the following must be false? :
(A) Rewind performs last.
(B) Nonesuch performs last.
(C) Simpleton performs seventh.
(D) Victim performs fifth.
(E) Moonshot performs sixth.

Go to Part 2