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
hmmmm by Saka Devi)
We had the same idea. :) But as I pointed out in my comment I may be wrong because it DOES say "...wants to take a detour to get there."
What do you think?
re: hmmmm
