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 does it say that he wants to visit each city only on the way to X. So here's my solution:
AGMSTUVWX (THEN ON HIS WAY HOME) RQPON HIJKL FEDCBA
It does say "he wants to take a detour to get there" so I'm probably wrong.
But I'm anxious to see the solution. :) This was fun.
Attempt
