Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Searching with probabilities
The development of a world class Othello program
Artificial Intelligence - Special issue on computer chess
Artificial Intelligence
Artificial Intelligence
The implementation of the Cilk-5 multithreaded language
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
MPI-The Complete Reference, Volume 1: The MPI Core
MPI-The Complete Reference, Volume 1: The MPI Core
Asynchronous parallel game-tree search
Asynchronous parallel game-tree search
Utility-based multi-agent system for performing repeated navigation tasks
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Performance analysis of two parallel game-tree search applications
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Randomized parallel proof-number search
ACG'09 Proceedings of the 12th international conference on Advances in Computer Games
| Hi-index | 0.00 |
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization both fixes a defect in the original algorithm and introduces significant parallelism. An experimental evaluation demonstrates that the algorithm is efficient (in terms of the number of search-tree vertices that it visits) and highly parallel. On incremental random game trees the algorithm outperforms Alpha-Beta, and speeds up by up to a factor of 18 (using 35 processors). In comparison, Jamboree [ICCA J. 18 (1) (1995) 3-19] speeds up by only a factor of 6. The algorithm outperforms Alpha-Beta in the game of Othello. We have also evaluated the algorithm in a Chess-playing program using the board-evaluation code from an existing Alpha-Beta-based program (Crafty). On a single processor our program is slower than Crafty by about a factor of 7, but with multiple processors it outperforms it: with 64 processors our program is always faster, usually by a factor of 5, sometimes much more.