I don't think that Sokoban can be solved with any computer program (except for very simple situations).
Just consider the number of available cells and the number of boxes; then compute the number of possible situations. Certainly, for any given situation there several moves that can be excluded. But there's no heuristic for choosing a good move, as it may be necessary to move boxes away from the target cells... -W On 24/01/2013, vojedav <[email protected]> wrote: > Thanks a lot Jeremy. I will take a look. Best regards, Victor > > > > -- > View this message in context: > http://drools.46999.n3.nabble.com/Drools-suitable-for-recursive-analysis-tp4021806p4021808.html > Sent from the Drools: User forum mailing list archive at Nabble.com. > _______________________________________________ > rules-users mailing list > [email protected] > https://lists.jboss.org/mailman/listinfo/rules-users > _______________________________________________ rules-users mailing list [email protected] https://lists.jboss.org/mailman/listinfo/rules-users
