“…For the case of mini-max search such approaches were developed in (Baum and Smith, 1997;Müller, 2001). (Chen, 2005) extends this approach to the case of combinatorial sums of independent games (Berlekamp, Conway, and Guy, 1982), and defines the framework of probabilistic combinatorial games (P CG). Figure 1 shows an idealized example of how PCG might be applied to Go.…”