[Drawkit] Now with added testing. (was Re: For the brave ; -)

[Graham Cox]

Just looking at your grids. Given that there are an odd number of  
points, and that the algorithm makes a "round trip", I think there is  
no way to make a path that doesn't have at least one diagonal. I can't  
prove it, but just trying to do it "by eye" I can't do it. If you  
relax the "round trip" requirement then there's no problem, so maybe  
that's something to focus on. A "round trip" is required as part of  
the original TSP problem, but for our needs isn't all that important.

cheers, Graham



On 1 Aug 2008, at 9:01 am, Brad Larson wrote:

> It gets close, but I did a trial on a few grids of 5 wide, 3 down  
> spots and found that it always stopped short of an optimal path