Dan, Here is another non-MI answer. The problem you are trying to solve is NP complete. That means someone has already come up with solutions that will fit this problem. One way to find a possible solution quickly would be a genetic algorithm. The thing you will need to determine if you use a genetic algorithm is what constitutes the solution(s); it sounds like you may want all possible solutions. There are a few Java solutions that run on the iSeries but I have only used JGAP, which is available at SourceForge. David Morris >>> dbale@xxxxxxxxxxxxx 9/20/2004 9:16:33 AM >>> > -----Original Message----- > From: mi400-bounces@xxxxxxxxxxxx / David Morris > Sent: Monday, September 20, 2004 11:05 AM > > I don't have anything MI related to add to this so I will keep it > short. Just so everyone knows, I am not necessarily partial to an MI solution. I just assumed that with all the bit-twiddling that MI seems capable of, that MI is the first place I might look. db
As an Amazon Associate we earn from qualifying purchases.
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.