(Trap_B)~A ID: Trappy Alpha-Beta with Two-Ply Iterative Deepening

摘要

In this paper, an improved trappy alpha-beta (simply (Trap_B)~A) algorithm, named (Trap_B)~A ID is proposed. (Trap_B)~A ID is an extended version of (Trap_B)~A by introducing the two-ply iterative deepening (TPID). By applying TPID, (Trap_B)~A ID can search more deeply and therefore find the traps hidden more deep plies in game-tree. The experimental results reflect that (Trap_B)~A ID indeed obtains the better chess playing performance than (Trap_B)~A.