Oh, I understand the Queens.java file, but much of the search behaviour is hidden inside Options.java, which is harder to follow. I was hoping you could explain some of that code as well.
Malcolm On 18/03/2008, at 2:28 PM, Christian Schulte wrote: > Did you check this one: > > http://www.gecode.org/gecodej/doc/PageIntro.html > > Christian > > -- > Christian Schulte, www.ict.kth.se/~cschulte/ > > > -----Original Message----- > From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On > Behalf > Of Malcolm Ryan > Sent: Tuesday, March 18, 2008 4:19 AM > To: gecode list > Subject: [gecode-users] Simpler examples? > > Hi, > > May I ask that you add some simpler examples to the GecodeJ > distribution, which do not use the Options class included? By being > able to handle all manner of different search types, the class loses > its value as an example. It is hard to follow and difficult to see > which bits are necessary and which bits are not. A bare-bones example > would be useful. What is the minimum amount you need to create a > problem and then solve it? > > Thanks, > > Malcolm > > > _______________________________________________ > Gecode users mailing list > [EMAIL PROTECTED] > https://www.gecode.org/mailman/listinfo/gecode-users _______________________________________________ Gecode users mailing list [EMAIL PROTECTED] https://www.gecode.org/mailman/listinfo/gecode-users
