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?

Nowhere in the question does it say (or even imply) that the man can only travel due north, south, east or west. So another possible trick (as per the category) is that at some point he takes a diagonal or curvy route round the country.

One such solution is ABCDEFLKJIHGMSTNOUVPQWRX (taking a NE path from W to R).

Posted by fwaff on 2004-05-19 11:22:44