Distributed Game-Tree Search Using Transposition Table Driven Work Scheduling

@inproceedings{Kishimoto2002DistributedGS,
  title={Distributed Game-Tree Search Using Transposition Table Driven Work Scheduling},
  author={Akihiro Kishimoto and Jonathan Schaeffer},
  booktitle={ICPP},
  year={2002}
}
The algorithm for two-player game-tree search has a notorious reputation as being a challenging algorithm for achieving reasonable parallel performance. MTD(f), a new variant, has become the sequential algorithm of choice for practitioners. Unfortunately, MTD(f) inherits most of the parallel obstacles of , as well as creating new performance hurdles. Transposition-table-driven scheduling (TDS) is a new parallel search algorithm that has proven to be effective in the single-agent (one-player… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 10 CITATIONS

A Parallel Algorithm for Game Tree Search Using GPGPU

  • IEEE Transactions on Parallel and Distributed Systems
  • 2015

A Node-based Parallel Game Tree Algorithm Using GPUs

  • 2012 IEEE International Conference on Cluster Computing
  • 2012

Research on connect 6 programming based on MTD(F) and Deeper-Always Transposition Table

  • 2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems
  • 2012
VIEW 1 EXCERPT
CITES BACKGROUND

Similar Papers

Loading similar papers…