
Posted by Moby Dick
![]()
on 19/6/2009, 2:08 pm, in reply to "Re: The Project"
> Quite a "novel" puzzle, MD!
Thanks - I did indeed write this one myself.
> So, if run in order 1 to 15:
> 5,3,1,3,4,4,3,1,2,5,1,0,0,0,0 = 32 hours saved
>
> If run in order 15 to 1:
> 5,5,5,5,4,0,3,4,2,1,1,2,4,2,0 = 43 hours saved
>
> Do I understand correctly?
Yes - that looks absolutely correct to me - so the best solution we have so far is [15,14,13,12,11,10,9,8,7,6,5,4,3,2,1] with 43 hours saved.


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