Hi Anderson,
Try a solution tabu of 1000 and combine it a move tabu of 7 (or even a
smaller prime number), tweak from there with the benchmarker.
How did you define your score function?
Op 13-11-10 01:27, Anderson Rocha schreef:
Hi all,
I am wondering if Drools Planner can handle the 8Puzzle problem. I
once resolved it with the A* search. But I do not know these simulated
annealing and tabu search that Drools Planner implements. So I am
having a "Getting stuck in local optima" problem, and depending on the
start sollution it gets into loop. But if you enter a really simple
start solution it resolves, because it choose the best scores until
finish with few steps. If some one can help, let me know what I can
send (source code, configuration files) to get some help.
Thanks,
Anderson
_______________________________________________
rules-users mailing list
rules-users(a)lists.jboss.org
https://lists.jboss.org/mailman/listinfo/rules-users
--
With kind regards,
Geoffrey De Smet