Parallel search in bivalued game trees (Q809606)

The author describes three parallel search strategies in bivalued game trees. Available processors are distributed statically by top down - and bottom up strategies and dynamically by a strategy which needs information at the inner nodes of the search tree to decide whether the processors should be distributed at one node. Empirical results verify that the third strategy is best and the top-down strategy is want.