Gene's probably your guy, reto. I'm not an algorithm expert, just a so- so chess programmer. I tend to see searches in terms of modified DFS with A/B.
I would suggest the first step is to familiarize yourself with A* search, and see what questions you have, after that. There's no need to learn Alpha Beta, just so you can then modify it to be similar to A*, to handle this task. The greatest efficiency will be found only by considering every box and piece, as part of a whole set. It increases the run time, but avoids the problem of "oh crap!" combinations of still to be packed pieces, (which just can't be packed efficiently now), which will arise if you consider just one box at a time. Adak --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
