We sensed there is space of optimaization during searching, as illustrated in 464 Can I Win minimax algorithm. Let's formalize this idea, called alpha beta pruning. For each node, we maintain two values alpha an
Greedy: This strategy uses the shortest path algorithm to move a piece toward the goal. UCTcut: This strategy uses the UCT algorithm with pruning and can simulate approximately 50,000 times per second. ABSeval: This strategy uses alpha–beta pruning combined with a transposition table and a ga...