[rules-users] Minimax Planning

[Chris Spencer]

How would you use Drools Planner to decide moves in a zero-sum
complete information game like Tic-Tac-Toe, Chess, Go, etc?

I understand how algorithms like Minimax are used for this, and I can
see how I could build a solver to calculate legal moves as well as the
fitness of each player's position after N hypothetical moves, but I'm
not sure I see how Planner could aggregate the scores of arbitrary
plans to find the action corresponding to the minimum/maximum score at
each step.

Regards,
Chris