#18 - Local, Must Be True, Minimum

[Dave Killoran]

Complete Question Explanation
(The complete setup for this game can be found here: lsat/viewtopic.php?t=5869)

The correct answer choice is (E).

There are three routes that satisfy the criteria in the question stem: S-T-Q-P, S-T-R-P, and S-U-R-P. As R or T or both appears in each of the possible routes, answer choice (E) is correct.

[deck1134]

Hi PowerScore,

I'm not sure why it is (E) here. I did the diagram correctly, but it seems that it would take more intermediate stops to do the S--U--R--G--Q route, so Why is "R" an intermediate answer? I do not understand.

[Dave Killoran]

Hi Deck,

The most efficient routes (or "fewest possible intermediate stops") each contain two intermediate stops. Those routes are:

• S - T - Q- P
  
  S - T - R - P
  
  S - U - R - P

So, you can see that each route contains R or T or both. Note also that traveling through G is not an option since, as you rightly note, it adds too many stops.

Thanks!

[T.B.Justin]

Does rule 2, 3 & 5 mean that all other stops are bypassed?

So, L2: R-T-S, L3: R-T-F-S-U, and L5: Q-P-R-T?

Edit: Answered my question by taking a look at the mapping game walk through in Lesson 6

[Brook Miscoski]

Thanks, Justin.