Bibliography

urlstyle

Abramson(1990)

B. Abramson.
Expected-outcome: A general model of static evaluation.
IEEE Transactions on Pattern Analysis and Machine Intelligence, 12(2):182-193, February 1990.

Bouzy(2004)

Bruno Bouzy.
Associating shallow and selective global tree search with monte carlo for 9x9 go.
In Proceedings of the 4th Computer and Games Conference (CG04), pages 67-80, Ramat-Gan, Israel, 2004.

Brecht and Colbourn(1988)

T. B. Brecht and C. J. Colbourn.
Lower bounds on two-terminal network reliability.
DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 21:185-198, 1988.

Bruegmann(1993)

Bernd Bruegmann.
Monte Carlo Go, 1993.
Available at http://www.cgl.ucsf.edu/go/Programs/.

McAllester and Rosenblitt(1991)

David McAllester and David Rosenblitt.
Systematic nonlinear planning.
In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91), volume 2, pages 634-639, Anaheim, California, USA, 1991. AAAI Press/MIT Press.
ISBN 0-262-51059-6.

Muggleton and De Raedt(1994)

S. Muggleton and L. De Raedt.
Inductive logic programming: Theory and methods.
Journal of Logic Programming, 19/20:629-679, 1994.

Müller(1999)

Martin Müller.
Decomposition search: A combinatorial games approach to game tree search, with applications to solving Go endgames.
In Proceedings of the International Joined Conference on Articial Intelligence (IJCAI 1999), volume 1, pages 578-583, 1999.

Siivola and Pellom(2005)

Vesa Siivola and Bryan Pellom.
Growing an n-gram language model.
In Proceedings of the 9th European Conference on Speech Communication and Technology (Interspeech'2005), Lisbon, Portugal, 2005.

van Rijswijck(2002)

Jack van Rijswijck.
Search and evaluation in Hex.
Technical report, Department of Computing Science, University of Alberta, 2002.