I'll try a breadth first version with caching after X-mas, the solution BUK showed seems to always chose one of the 3 shortest edges (visual check), but I hope it wont take 27h. =)
Cheers Rolf
( addicted to the Perl Programming Language)
In reply to Re^7: Travelling problem (Anyone better 86850?)
by LanX
in thread Travelling problem
by Dirk80
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |