This paper deals with a parallelization of our Controlled Conspiracy Number Search (CCNS) algorithm. CCNS is marked by the fact that there are two kinds of pieces of information: Values are updated bottom up with minimax rules, and security demands, so called targets, control the selective search top down. As CCNS is a best rst search procedure, all nodes are kept in memory. We present a method that maps these nodes onto several processors. The resulting load and space sharing problem is solved half dynamically and half statically. Our solution leads to good speedup results.