A parallel search chess program

@inproceedings{Newborn1985APS,
  title={A parallel search chess program},
  author={Monty Newborn},
  booktitle={ACM Annual Conference},
  year={1985}
}
A chess program that runs on a multiprocessing system consisting of eight essentially identical Data General computers is described. Eclipse S/120, six Nova 4's, The computers, an and a Nova 3 are connected together by a high speed bus. One would like to be able to report that the eight computers search a chess tree eight times as fast as a single computer. Based on algorithms described in this paper, a speedup by a factor of 5.03 has been achieved. The time spent in communication among… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Similar Papers

Loading similar papers…