LSAT 20, Game 1 Setup, Airplane Seats, LSATHacks

Game Setup

This is a grouping game. We have to decide how to put seven travelers into nine plane seats. There will always be two empty plane seats.

We can arrange this vertically, with three rows: F, M, and L. We’ll draw some rules directly on the main diagram.

O is in the last row. P is beside R and an empty seat. R is behind N. This means we have to put N in the first row and P and R in the second row. We can’t put P and R in the last row because there has to be an empty seat beside P. (If O, P and R were all in the last row, there would be no empty seat)

   

(The variables on the right have to go in those rows)

There are a couple scenarios we can draw in this game. But the game depends mainly on clearly understanding the rules.

Nobody else can go in the second row so everybody else goes in row 1 or row 3. That’s U, S and T.

We know that N can’t go beside U and N can’t go beside S.

That means that if U and S are in the first row then they are one seat away from N.

So we could have, for example, N in seat 1 and one of U and S in seat 3. The other U and S would be in the last row.

T would either be in the second or last row. Severalf variables are interchangeable. U or S could be in 1 and N could be in 3 instead.

It doesn’t really matter: there are no rules about that kind of ordering. N and U/S just have to be apart from each other.

The other possibility is that U, S and O are all in the last row. Then we could have N in seat 2 and T in 1 or 3.

Or

We could also have N in seat 1 and T in seat 3, or vice versa.            

That’s pretty much it. These scenarios aren’t essential. I’ve just drawn them to give you an idea of how the game can go. Make sure to look over all the rules as the game depends on your knowing them.

---