dear adak & gene, thanks for the interesting thoughts you provided. obviously i'm not an algorithm expert but i'm a very experienced C# developer. so i need this thing explained with simple terms. to further define near by, profiles of the same shape have to be either packed next or on top of each other. to try each possible layout and pick the one with the least amount of wasted space seems to be pretty straight forward. this works fine if we only pack 1 box, but what if we have to pack let's say 5 boxes of different profiles? then the layout combinations spread across all the boxes.
reto On Oct 16, 7:34 am, adak <[EMAIL PROTECTED]> wrote: > Obviously there is no need for the one line of code that deals with > minimizing /maximizing player's moves, in this case. > > A/B would still prune, but it would only prune out the piece > arrangements that left sub optimal piece arrangements, with more > wasted space. > > You're right, Gene, this is indeed an interesting problem. Wish I had > more time to study it. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" 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/algogeeks -~----------~----~----~----~------~----~------~--~---
