Parallel Randomized Best-First Minimax Search

@article{Shoham2002ParallelRB,
  title={Parallel Randomized Best-First Minimax Search},
  author={Yaron Shoham and Sivan Toledo},
  journal={Artif. Intell.},
  year={2002},
  volume={137},
  pages={165-196}
}
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 AlphaBeta, and speeds… CONTINUE READING
BETA

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

Crafty

  • R. Hyatt
  • Computer program, available online from ftp://ftp…
  • 1999
Highly Influential
2 Excerpts

Chess in 2010

  • E. Schroder
  • Available online at http://www.rebel.nl/ches2010…
  • 2002
1 Excerpt

The Louguet Chess Test II (LCT II) FAQ. Available online at http://www.icdchess.com/wccr/ testing/LCTII/lct2faq.html

  • F. Louguet
  • 1996

Anatomy of a chess program

  • T. Marsland
  • In the brochure of the 8th World Computer Chess…
  • 1995
1 Excerpt

Similar Papers

Loading similar papers…