A New Heuristic Search Algorithm for Capturing Problems in Go

Monte Carlo Go Capturing Tactic Search

“…5 The average time in Table 1 is the the average time cost for solved problems. Table 2 shows that pseudo ladder largely increases the ability of Go capturing computation.…”

“…It has produced much stronger Go playing programs compared to traditional knowledge and search based programs. 8 When facing a standard 19 × 19 Go board, human players usually identify and solve a number of local tactic problems 3 such as capturing, 5,13 connection, 4 life and death 6 as key information in making the final move decision. Solving Go tactic problems is an important step towards building a strong 19×19 Go playing program.…”