In Gridland, the cities are arranged in a 4 by 6 grid:

A-B-C-D-E-F
| | | | | |
G-H-I-J-K-L
| | | | | |
M-N-O-P-Q-R
| | | | | |
S-T-U-V-W-X

A man born in A (and never ventured outside his city) has to visit a man in X but wants to take a detour to get there. He wants to visit every city but not enter any city more than once during his tour. How should his trip go?

(In reply to Solution by Brian Smith)

Although other people proposed the same idea/solution, Brian was the first that was posted.  I like this idea best.  Even better than the proposed solution, but that is my opinion. 

Someone mentioned not going along the straight roads as indicated by the grid lines, but we all assumed they represented roads so that was really was not viable.  Along the same lines I can say that it never says that we can not fly.  So we could drive to w say by many methods. Then fly to R and drive to X.  I know WEAK!

Posted by john on 2005-03-01 21:26:05