Changes

Jump to: navigation, search

Search with Random Leaf Values

3 bytes added, 11:48, 19 February 2019
no edit summary
* [[Ulf Lorenz]], [[Burkhard Monien]] ('''2002'''). ''[http://www.springerlink.com/content/f6b4wb6l63dpd0jv/ The Secret of Selective Game Tree Search, When Using Random-Error Evaluations]''. Proceedings of 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS), [http://www.top-5000.nl/ps/The%20secret%20of%20selective%20earch%20when%20using%20random.pdf pdf]
* [[Ingo Althöfer]], [[Susanne Heuser]] ('''2005'''). ''Randomised Evaluations in Single-Agent Search''. [[ICGA Journal#28_1|ICGA Journal, Vol. 28, No. 1]], [https://www.minet.uni-jena.de/preprints/althoefer_05/altheuser.pdf preprint as pdf]
* [[Brandon Wilson]], [[Austin Parker]], [[Dana S. Nau]] ('''2009'''). ''Error Minimizing Minimax: Avoiding Search Pathology in Game Trees''. [http://www.cs.umd.edu/~nau/papers/wilson2009error.pdf pdf]
=Forum Posts=

Navigation menu