- Tue Jan 12, 2016 5:57 pm
I'm afraid you and I must have different versions of that book, and I can't find that problem in my copy. That said, with the information provided it appears to me that the game is not about putting the cities in one particular order, but rather about which cities can be connected to which other cities by those highways (much like other games that involve maps, or like the paths in the ski chalet game). Which cities can B connect to? That's a group. Which cities can F connect to? That's another group. Try attacking it that way and see what happens.
The rules in the ski chalet game make it so that each chalet can connect only to two other chalets, and the paths must be straight, so no looping around to the back door to avoid crossing paths! In that sense, that game should be a little easier to deal with than the highways exercise because it will be more restricted. After you have played a bit with the highways, give that chalet game a go. Maybe try sketching out a few templates to see what could possibly happen once you start making connections?
Adam M. Tyson
PowerScore LSAT, GRE, ACT and SAT Instructor
Follow me on Twitter at https://twitter.com/LSATadam