Move selection in MTD(f)

摘要

In previous publications on the MTD(f) algorithm, the intricacies of the mechanisms to select (1) the best move (the move to play), (2) the move to store in the transposition table (TT), (3) the principal variation (PV), if any, and (4) the move to ponder on (the move the opponent is expected to play) are left to the reader. This note(1) fills a theoretic void on these four topics, showing that in the presence of search inconsistencies there is a safe mechanism to select the best move. Selecting a ponder move is also investigated. Experimental results in 10 x 10 draughts are summarized and provided online.