Hello Drools Users,

I've been investigating Drools Planner for a few weeks and can't figure out how to accomplish a crucial requirement.

In my application I need to have Planner return multiple solutions for one planning problem.  More specifically I need is to find all of the ideal solutions to my planning problem.  My problem is similar to the n-queens problem in that there exist ideal solutions.  It is however somewhat simpler because the number of ideal solutions is fairly small (maybe a max of 10 or so).

I've looked through the mailing list archives for similar requests and the best I could find was: 

http://drools-java-rules-engine.46999.n3.nabble.com/the-n-best-solutions-on-a-very-simple-test-case-td60618.html

I took the advice of the poster in that thread and extended BestSolutionRecaller.  I'm running into some problems getting Planner to continue after an optimal solution is found.

My question is this.  Is extending the BestSolutionRecaller the best way to achieve my goal? Or do you think it would be simpler to do this another way?  Perhaps running Planner multiple times with already discovered solutions provided as input.

Any advice would be appreciated.

Thanks,

Steve