Transposition-Driven Scheduling in Parallel Two-Player State-Space Search

@inproceedings{Steenhuisen2005TranspositionDrivenSI,
  title={Transposition-Driven Scheduling in Parallel Two-Player State-Space Search},
  author={J. Renze Steenhuisen},
  year={2005}
}
This thesis describes the design and implementation of a parallel two-player statespace searcher called DARKSIGHT. The program uses principal variation search as its main search algorithm with numerous additional techniques and heuristics. The young-brothers-wait concept is used as the splitting strategy. Transpositiondriven scheduling is used as its load-balancing scheme, which achieved near-linear speedups in parallel one-player state-space search. Our experiments show that transposition… CONTINUE READING

References

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

Introduction to Parallel Computing

A. Grama, A. Gupta, G. Karypis, V. Kumar
  • Addison Wesley,
  • 2003
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

A Taxonomy of Parallel Game-Tree Search Algorithms

  • ICGA Journal
  • 1996
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

APHID: Asynchronous Parallel Game-Tree Search

  • J. Parallel Distrib. Comput.
  • 2000
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Modeling the “Go Deep” Behaviour

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…