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?
you start at a going left down to l going right to g going down to m going right to r down to x going left to s
|
|
Posted by dex
on 2007-09-24 15:09:48 |
the answer
