by ManhattanPrepLSAT1 Mon Aug 16, 2010 2:32 pm
Happy to help!
14. You're exactly right. T, G, P, and U are all reachable without making any intermediate stops.
18. This one is tough. But because U -- Q is blocked in both directions some of the possible routes using the fewest intermediate stops are not available. The fewest number of intermediate stops is two but that still leaves the following routes.
1. S -- T -- R -- P
2. S -- T -- Q -- P
3. S -- U -- R -- P
(A) the 3rd route uses neither F nor T
(B) the 1st route uses neither G nor U
(C) the 3rd route uses neither Q nor T
(D) the 1st route uses neither Q nor U
(E) correct! every route has either an R or T or both
Also, you're not likely to see a game like this on the LSAT as games that rely on maps aren't frequent on today's LSAT. However, there was a game in 2003 that also relied on a map, so it's not impossible. If you see that you're being asked to connect things with lines or place things into areas like
PT15, S4, G2 - The country of Zendu
then you might want to consider drawing out a diagram that reflects the scenario visually.
Hope that helps!