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 Another alternative by fwaff)

Actually the lines are supposed to represent roads; I suppose I thought everyone knew that, but you can never be sure with these trick problems. :)

Posted by Gamer on 2004-05-19 15:37:50