
Posted by markr on 16/9/2009, 7:08 am, in reply to "Re: General passageway"
1,102,103 (1 returns) : 104
1,2,101 (1 returns): 102
104,105,106 (2 returns) : 108
1,2,100 (finished) : 100
Total: 414 and dependent on d (101)
However, I'm not claiming that this is optimal. I just quickly applied the approach described in my post above.


Message Thread:
![]()
« Back to thread