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?
This problem is impossible without a trick. I think maybe the key is that the man wants to enter every city -- so we could say that he should also enter A!
In that case he could start with something like G-A-B-H-N-M-S-T-... and the rest is obvious.
Possible
