NQueens is one of the examples of drools-solver.
It isn't optimized because it's used to explain drools-solver in the
manual, so don't use it for benchmarking.
Drools-solver is a planning engine which combines the drools rule engine
for score calculation with the scalability of local search algorithms
(tabu search, simulated annealing, ...).
Drools-solver is an experimental module of 5.0.0.M1,
you can download it here:
http://www.jboss.org/drools/downloads.html
And just run runExamples.sh/bat and pick nqueens.
The manual hasn't been released on the official site yet,
but you can find an outdated version here:
http://users.telenet.be/geoffrey/tmp/solver/manual/html_single/
An up to date version is in subversion.
Feedback welcome :)
Paul Fodor schreef:
Dear Sir,
I am new to Drools and I wonder if any of the classic declarative
problems, such as, nqueens, puzzle16 were implemented in Drools by
anyone. I realize that might be hard because of the bottom-up
evaluation.
Regards,
Paul Fodor
_______________________________________________
rules-users mailing list
rules-users@lists.jboss.org
https://lists.jboss.org/mailman/listinfo/rules-users
_______________________________________________
rules-users mailing list
rules-users@lists.jboss.org
https://lists.jboss.org/mailman/listinfo/rules-users
