Game tree searching by min/max approximation
Artificial Intelligence
Conspiracy numbers for min-max search
Artificial Intelligence
On parallel evaluation of game trees
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Artificial Intelligence - Special issue on computer chess
Studying overheads in massively parallel MIN/MAX-tree evaluation
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Transposition table driven work scheduling in distributed search
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Parallel controlled conspiracy number search
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Controlled Conspiracy-2 Search
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
The Secret of Selective Game Tree Search, When Using Random-Error Evaluations
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Parallel Monte-Carlo tree search for HPC systems
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
Randomized parallel proof-number search
ACG'09 Proceedings of the 12th international conference on Advances in Computer Games
| Hi-index | 0.01 |
Tree search algorithms play an important role in many applications in the field of artificial intelligence. When playing board games like chess etc., computers use game tree search algorithms to evaluate a position. In this paper, we present a procedure that we call Parallel Controlled Conspiracy Number Search (Parallel CCNS). Briefly, we describe the principles of the sequential CCNS algorithm, which bases its approximation results on irregular subtrees of the entire game tree. We have parallelized CCNS and implemented it in our chess program P. ConNerS, which now is the first in the world that could win a highly ranked Grandmaster chess-tournament. We add experiments that showa speedup of about 50 on 159 processors running on an SCI workstation cluster.