# Ordering Games

These games require you to order elements, either in a line or around a circle. The criteria used to determine order can include size, time, rank, etc. Ordering games are the easiest games on the LSAT. Luckily, they are also the most common.

Which one of the following people must be last in line?

Example:

*Ordering Game*Six people—Rick, Steve, Terry, Ulrika, Vivian, and Will—are standing in line for tickets to an upcoming concert.

Rick is fifth in line and is not next to Steve.

Ulrika is immediately behind Terry.

Will is not last.

Ulrika is immediately behind Terry.

Will is not last.

Which one of the following people must be last in line?

- Steve
- Terry
- Ulrika
- Vivian
- Rick

Solution

Clearly, Rick cannot be last since he is already fifth. So, eliminate choice (E).
Next, neither Terry nor Ulrika can be last since Ulrika must stand immediately behind Terry. So, eliminate choices (B) and (C).
Finally, Steve cannot be last, either. If he were, then he would be next to Rick, which would violate the first condition. So, eliminate choice (A).
Hence, by process of elimination, Vivian must be last in line.
The answer is (D).

# Grouping Games

Grouping games, as the term implies, require you to separate elements—typically people—into groups. Some conditions of the game can apply to entire groups only, some to elements within a group only, and some to both. This added complexity makes grouping games, in general, harder than ordering games.Example:

*Grouping Game*Eight people—A, B, C, D, E, F, G, and H—ride to work in three cars. Two cars each take three people, and one car takes only two people.

B rides with H.

G rides with only one other person.

F rides with two other people.

G rides with only one other person.

F rides with two other people.

If C rides with B, all of the following are groups of people that can ride together EXCEPT:

- A and G
- G and E
- A, D, and E
- A, D, and F
- B, C, and H

Solution

Combining the conditions
Now F and G must ride in different car-pools because G rides in a pool of two and F rides in a pool of three.
However, the group ADE, in choice (C), could not ride with either F or G because in either case they would form a group of four.
Hence, (C) is the answer.

*“C rides with B”*and*“B rides with H”*gives the completed car-pool CBH.

# Assignment Games

These games involve assigning characteristics to the elements, typically people. The most common task in these games is to assign a schedule. You probably have had some experience with schedules; you may have written the weekly work-schedule for a business. If so, you know how difficult the task can become, even when only a few conditions are placed on the employees: Bob will work Monday, Tuesday, or Friday only. Susan will work evenings only. Steve will not work with Bob. Add to this that the company must have a full staff weekdays, but only three people can work weekends. Scheduling games on the LSAT are similar to this. Because the conditions can apply to individuals separately, to groups of individuals, to times, to places, etc., scheduling games tend to be the most difficult—save them for last.Example:

*Assignment Game*The Mom & Pop liquor store employs five cashiers—Adams, Bates, Cox, Drake, and Edwards—each of whom works alone on exactly one day, Monday through Friday.

Adams will work only on Tuesday or Thursday.

Bates will not work on Monday or Wednesday.

Cox works on Friday.

Drake and Edwards do not work on consecutive days.

Bates will not work on Monday or Wednesday.

Cox works on Friday.

Drake and Edwards do not work on consecutive days.

Which one of the following is a possible work schedule?

- Edwards, Bates, Adams, Drake, Cox
- Drake, Adams, Bates, Edwards, Cox
- Edwards, Adams, Cox, Bates, Drake
- Edwards, Adams, Drake, Bates, Cox
- Drake, Edwards, Bates, Adams, Cox

Solution

Begin by eliminating (A); it is not a possible work schedule since the first condition states that Adams works only on Tuesday or Thursday.
Next, (B) is not a possible work schedule since the second condition states that Bates will not work on Monday or Wednesday.
Next, (C) is not a possible work schedule since the third condition states that Cox works on Friday.
Finally, (E) is not a possible work schedule since the last condition states that Drake and Edwards do not work on consecutive days.
Thus, by process of elimination, we have learned the answer is (D).

We will thoroughly analyze each of the three major types of games. Additionally, we will study some games that don’t fit neatly into this classification.