Opponent modeling in scrabble

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 1482-1487

  Richards, Mark ^a   Amir, Eyal ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BAYES' THEOREM; DECISION MAKING PROCESS; OPPONENT MODELING; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS; TRAINING HUMANS;

ARTIFICIAL INTELLIGENCE;

EID: 70549084537     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Hans Berliner. The B*tree search algorithm: A best-first proof procedure. Artif. Intell., 12:23-40, 1979. (Pubitemid 9464120)
2. Darse Billings, Aaron Davidson, Jonathan Schaeffer, and Duane Szafron. The challenge of poker. Artif. Intell., 134:201-240, 2002.
3. William Bolstad. Introduction to Bayesian Statistics. Wiley, Indianapolis, IN, 2004.
4. Joe Edley and John D.Williams. Everything Scrabble. Pocket Books, New York, 2001.
5. M. L. Ginsberg. GIB: Steps toward an expert-level bridge-playing program. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99), pages 584-589, 1999.
6. Michael Lederman Littman. Algorithms for sequential decision making. Technical Report CS-96-09, 1996.
7. Merriam-Webster. The Official Scrabble Players Dictionary. Merriam-Webster, 2005.
8. Fred L. Ramsey and Daniel W. Schafer. The Statistical Sleuth: A Course in Methods of Data Analysis. Duxbury, Pacific Grove, CA, 2002.
9. Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs, NJ, 2nd edition edition, 2003.
10. Brian Sheppard. World-championship-caliber Scrabble. Artif. Intell., 134:241-245, 2002.