The Downtown area of Grid City consists of 10 intersecting streets in a 5x5 grid. Most of the intersections are 4way, but exactly one intersection on each street is actually an overpass, one street going over the other, forcing drivers to keep straight.
Four different men (with license plates 5, 7, 8, and 9) enter and exit downtown in different spots. Some facts about their routes are as follows:
 No driver enters the same intersection more than once.
 At each nonoverpass intersection, all drivers that entered it from north/south turned a certain way (right or left) at that particular intersection, and all drivers that entered it from east/west turned the opposite way.
 The number of turns each driver made downtown equals the number on his license plate.
Given this map of the region, where does 5 exit downtown, and what paths do each of them take?
7 9
    
9+++++
    
+++++7
    
+++++8
    
+++++
    
8+++++
    
5
I think I've got a setup that works. However, there are two different possible exit points for the #5 car...
I'll use + to indicate an intersection with an overpass, / to indicate an intersection where the northsouth cars turn right, and \ to represent an intersection where the northsouth cars turn left. If it helps, picture the cars as lasers being reflected off of mirrors or something...
7 9
9 \ / / \ +
\ \ + \ / 7
+ \ / \ / 8
/ + / \ /
8 / +
5
I've intentionally left some of the intesections blank because they are not in the path of the 7, 8, and 9 cars. Depending on how you set up these missing intersections, the 5 car could follow two separate paths:
7 9
9 \ / / \ +
\ \ + \ / 7
5 + \ / \ / 8
/ + / \ /
8 / \ / +
5
Or:
7 9
9 \ / / \ +
\ \ + \ / 7
\ / \ / 8
/ + / \ / 5
8 / \ + /
5

Posted by tomarken
on 20061108 21:13:23 