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?
He goes abcdeflkjihgmnopqrxwvuts at no point did you say x was the last city he was to takejust that he wanted to go to them all and visit a man while in x.
|
|
Posted by Lenny
on 2006-10-04 18:33:25 |
Another solution
