Fixed DFPN best move selection (#74)

pwyq / Fill-Game

Two Player (Adversarial) Version of Fillomino | (Depth-First) Proof Number Search, Monte Carlo Tree Search, Minimax, Negamax, Alpha-beta pruning

GNU General Public License v3.0

2 stars 0 forks source link

Closed Stalfoes closed 1 year ago

Stalfoes commented 1 year ago

Fixed best move selection for the DFPN algorithm.

In summary, we just needed to re-compute the best child after the while loop in MID.