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?
How about this. (i havent looked at the solution so dont tell me i copied. OR i might have something different!)
Since this is a DETOUR. usually detour involve going somewhere u usually dont go. he goes agmstnhbciouvpjdekqw, THEN travels outside of grid land and comes back in at flrx. TADA
I got a NEW trick!
