The Secret of Selective Game Tree Search, When Using Random-Error Evaluations

Ulf Lorenz, Burkhard Monien. The Secret of Selective Game Tree Search, When Using Random-Error Evaluations. In Helmut Alt, Afonso Ferreira, editors, STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings. Volume 2285 of Lecture Notes in Computer Science, pages 203-214, Springer, 2002. [doi]

@inproceedings{LorenzM02,
  title = {The Secret of Selective Game Tree Search, When Using Random-Error Evaluations},
  author = {Ulf Lorenz and Burkhard Monien},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2285/22850203.htm},
  tags = {search},
  researchr = {https://researchr.org/publication/LorenzM02},
  cites = {0},
  citedby = {0},
  pages = {203-214},
  booktitle = {STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  editor = {Helmut Alt and Afonso Ferreira},
  volume = {2285},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-43283-3},
}