next up previous contents
Next: Table of Abbreviations Up: Probabilities and Simulations in Previous: Conclusions and future work

Bibliography

1
Hans Berliner, Gordon Goetsch, Murray Campbell, and Carl Ebeling.
Measuring the performance potential of chess programs.
Artificial Intelligence, 12(1):23-40, 1990.

2
Darse Billings.
Computer poker.
Technical Report TR 95-22, Department of Computing Science, University of Alberta, 1995.

3
Darse Billings, Denis Papp, Lourdes Peña, Jonathan Schaeffer, and Duane Szafron.
Using selective-sampling simulations in poker.
In AAAISS-99 Proceedings on search techniques for problem solving under uncertainty and incomplete information, 1999.

4
Darse Billings, Denis Papp, Jonathan Schaeffer, and Duane Szafron.
Opponent modeling in poker.
In AAAI-98, pages 493-499. The MIT Press, 1998.

5
Darse Billings, Denis Papp, Jonathan Schaeffer, and Duane Szafron.
Poker as a testbed for ai research.
In Robert E. Mercer and Eric Neufeld, editors, Advances in Artificial Intelligence, pages 228-238. Springer-Verlag, 1998.

6
Darse Billings, Lourdes Peña, Jonathan Schaeffer, and Duane Szafron.
Using probabilistic knowledge and simulation to play poker.
In AAAI-99, 1999.
In press.

7
David Carmel and Shaul Markovitch.
Incorporating opponent model into adversary search.
In AAAI-96, pages 120-125. The MIT Press, 1996.

8
Steve B. Cousins, William Chen, and Mark E. Frisse.
A tutorial introduction to stochastic simulation algorithms for belief networks.
Artificial Intelligence in Medicine, 5:315-340, 1993.

9
Nicholas V. Findler.
Studies in machine cognition using the game of poker.
Communications of the ACM, 20(4):230-245, April 1977.

10
Nicholas V. Findler.
Computer poker.
Scientific American, 239:144-151, July 1978.

11
Robert Fung and Kuo-Chu Chang.
Weighting and integrating evidence for stochastic simulation in bayesian networks.
In M. Henrion, R. Shachter, L. N. Kanal, and J. Lemmer, editors, Uncertainty in Artificial Intelligence 5, pages 209-220. Elsevier Science Publishers, 1990.

12
Mathew L. Ginsberg.
Partition search.
In AAAI-96, pages 228-233. The MIT Press, 1996.

13
Mathew L. Ginsberg, April 13, 1999.
Personal communication.

14
Mathew L. Ginsberg.
Gib: Steps toward an expert-level bridge-playing program.
In IJCAI-99, 1999.
In press.

15
Daphne Koller and Avi Pfeffer.
Generating and solving imperfect information games.
In IJCAI-95, pages 1185-1192, August 1995.

16
Daphne Koller and Avi Pfeffer.
Representations and solutions for game-theoretic problems.
Artificial Intelligence, 94(1-2):167-215, 1997.

17
Kevin B. Korb, Ann E. Nicholson, and Nathalie Jitnah.
Bayesian poker.
In UAI-99, 1999.
In press.

18
T. Anthony Marsland.
Computer chess and search.
Technical Report TR 91-10, Department of Computing Science, University of Alberta, 1991.

19
Denis Papp.
Dealing with imperfect information in poker.
Master's thesis, Department of Computing Science, University of Alberta, 1998.

20
Stuart Russell and Peter Norvig.
Artifical Intelligence: A Modern Approach,.
Prentice-Hall, Englewood Cliffs, NJ, ISBN 0-13-103805-2, 1995.

21
Jonathan Schaeffer, Darse Billings, Lourdes Peña, and Duane Szafron.
Learning to play strong poker.
In ICML-99 Workshop on Machine Learning in Game Playing, 1999.
In press.

22
Ross D. Shachter and Mark A. Peot.
Simulation approaches to general probabilistic inference on belief networks.
In M. Henrion, R. Shachter, L. N. Kanal, and J. Lemmer, editors, Uncertainty in Artificial Intelligence 5, pages 221-231. Elsevier Science Publishers, 1990.

23
Claude E. Shannon.
Programming a computer for playing chess.
Philosophical Magazine, 41(4):256-275, 1950.

24
Brian Sheppard, October 23, 1998.
Email.

25
Stephen F. Smith.
Flexible learning of problem solving heuristics through adaptive search.
In IJCAI-83, pages 422-425, 1983.

26
Richard S. Sutton and Andrew G. Barto.
Reinforcement learning: An introduction, chapter 11.
The MIT Press, Cambridge, MA, 1998.
http://www-anw.cs.umass.edu/ rich/book/11/node2.html.

27
Gerald Tesauro.
Temporal difference learning and TD-Gammon.
Communications of the ACM, 38(3):58-68, March 1995.
http://www.research.ibm.com/massdist/tdl.html.

28
Alan M. Turing, Christopher Strachey, M. A. Bates, and Bertram V. Bowden.
Digital computers applied to games.
In B. V. Bowden, editor, Faster Than Thought, pages 286-310. Pitman, London, 1953.

29
John Von Neumann and Oskar Morgenstern.
Theory of games and economic behavior.
Princeton University Press, Princeton, New Jersey, first edition, 1944.

30
Donald A. Waterman.
A generalization learning technique for automating the learning of heuristics.
Artificial Intelligence, 1:121-170, 1970.



Lourdes Pena
1999-09-10