It's an NP problem, definitely. Chances are that the "obvious" heuristic wont be the optimal one.
It's like this: http://www.cfcl.com/vlb/Cuute/Puzzles/17min_puzzle.html Only harder... On 10 September 2010 19:31, TC <[email protected]> wrote: > We do have some proprietary algorithms that do full geometry piecing > and collaboration on cores. However what I'm looking for is much > simpler. Really at this point I'm just looking to find the number of > different cores of each type used and the total linear footage that > makes up said cores. Only paying attention to length. > > The code im attempting to clean up is about 600 lines and brute forces > through several arrays multiple times. While it returns the correct > number of each length core we need it is slow and not as > mathematically accurate as I believe it could be. > > If it helps give you scope the different lengths we have to work with > are 144, 120, 96, 72, 48 in inches. > > -- > You received this message because you are subscribed to the Google Groups > "The Java Posse" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<javaposse%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/javaposse?hl=en. > > -- Kevin Wright mail / gtalk / msn : [email protected] pulse / skype: kev.lee.wright twitter: @thecoda -- You received this message because you are subscribed to the Google Groups "The Java Posse" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/javaposse?hl=en.
