Efficient best-first search algorithms have been developed for deterministic two-player games with two-outcome.We present a formal framework to represent such best-first search algorithms.The framework is general enough to express popular algorithms such as Proof Number Search, Monte Carlo Tree...

The separation game is different from the connection game, but has some similarities. In the game of Go, it is often useful because it helps to enclose groups and areas. An evaluation function, moves generation functions and a search algorithm for the separation game are described in this paper.