|
Warning: The download time has expired please click on the item to try again.
ABSTRACT
Ever since the days of Shannon's proposal for a chess-playing algorithm [12] and Samuel's checkers-learning program [10] the domain of complex board games such as Go, chess, checkers, Othello, and backgammon has been widely regarded as an ideal testing ground for exploring a variety of concepts and approaches in artificial intelligence and machine learning. Such board games offer the challenge of tremendous complexity and sophistication required to play at expert level. At the same time, the problem inputs and performance measures are clear-cut and well defined, and the game environment is readily automated in that it is easy to simulate the board, the rules of legal play, and the rules regarding when the game is over and determining the outcome.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Berliner, H. Computer Backgammon Sci. Amer. 243, 1, (1980), 64-72.
|
| |
2
|
|
| |
3
|
|
| |
4
|
|
| |
5
|
|
| |
6
|
Isabelle, J.-F. Auto-apprentissage, a paide de research de neurones, de fonctions heuristic utilities dans les. jeux strageties Master's thesis.. Univ of Montreal, 1993
|
| |
7
|
Magreal,P. Backgammon, Times Books, Newyork, 19736.
|
| |
8
|
Robertie. B, Carbonm Versus silicon: Matching wits with TD-Gammon. Inside Backmonnom 2, 2, (1992), 14-22.
|
| |
9
|
|
| |
10
|
Samuel, A. Some studies in machine learning using the game of checkers Ibm J. of Research and Deveopment 3. (1959), 210-229
|
| |
11
|
Schraudolph, N.N. DAyan P. and Sjnoeski, Tj> Temporal difference learning of positoin evaluation in the game of Go. In J. D, Cowan, el al. Eds., Advances in Neural Information Processing Systems 6, 817-824.Morgan Kaufmann, San Mateo, Calif 1994
|
| |
12
|
Shannon, C.E Programming aComputer for Playing Chess. Philosophical Mag,41, (1950), 265-275.
|
| |
13
|
|
| |
14
|
Tesauro, G. Neurogammon wins Computer Olympiad. Neura Computation-I, (1989),321-323.
|
| |
15
|
|
| |
16
|
Zadeh, N, and Kobiska, G. On optima doubing in backgammon, Manage, sci. 23 (1977), 853-858.
|
CITED BY 90
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Darse Billings , Lourdes Peña , Jonathan Schaeffer , Duane Szafron, Learning to play strong poker, Machines that learn to play games, Nova Science Publishers, Inc., Commack, NY, 2001
|
|
|
|
|
|
|
|
|
Pascal Poupart , Nikos Vlassis , Jesse Hoey , Kevin Regan, An analytic solution to discrete Bayesian reinforcement learning, Proceedings of the 23rd international conference on Machine learning, p.697-704, June 25-29, 2006, Pittsburgh, Pennsylvania
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Sooraj Bhat , David L. Roberts , Mark J. Nelson , Charles L. Isbell , Michael Mateas, A globally optimal algorithm for TTD-MDPs, Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, May 14-18, 2007, Honolulu, Hawaii
|
|
|
|
|
|
Mark J. Nelson , David L. Roberts , Charles L. Isbell, Jr. , Michael Mateas, Reinforcement learning for declarative optimization-based drama management, Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, May 08-12, 2006, Hakodate, Japan
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Engin Ipek , Sally A. McKee , Karan Singh , Rich Caruana , Bronis R. de Supinski , Martin Schulz, Efficient architectural design space exploration via predictive modeling, ACM Transactions on Architecture and Code Optimization (TACO), v.4 n.4, p.1-34, January 2008
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Bethany R. Leffler , Michael L. Littman , Timothy Edmunds, Efficient reinforcement learning with relocatable action models, Proceedings of the 22nd national conference on Artificial intelligence, p.572-577, July 22-26, 2007, Vancouver, British Columbia, Canada
|
|
|
|
|
|
Shogo Takeuchi , Tomoyuki Kaneko , Kazunori Yamaguchi , Satoru Kawai, Visualization and adjustment of evaluation functions based on evaluation values and win probability, Proceedings of the 22nd national conference on Artificial intelligence, p.858-863, July 22-26, 2007, Vancouver, British Columbia, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Megan Smith , Stephen Lee-Urban , Héctor Muñoz-Avila, RETALIATE: learning winning policies in first-person shooter games, Proceedings of the 19th national conference on Innovative applications of artificial intelligence, p.1801-1806, July 22-26, 2007, Vancouver, British Columbia, Canada
|
|
|
|
|
|
Arthur Guez , Robert D. Vincent , Massimo Avoli , Joelle Pineau, Adaptive treatment of epilepsy via batch-mode reinforcement learning, Proceedings of the 20th national conference on Innovative applications of artificial intelligence, p.1671-1678, July 13-17, 2008, Chicago, Illinois
|
|
|
Tom Croonenborghs , Jan Ramon , Hendrik Blockeel , Maurice Bruynooghe, Online learning and exploiting relational models in reinforcement learning, Proceedings of the 20th international joint conference on Artifical intelligence, p.726-731, January 06-12, 2007, Hyderabad, India
|
|
|
|
|
|
|
|
|
|
|
|
Jonathan Schaeffer , Markian Hlynka , Vili Jussila, Temporal difference learning applied to a high-performance game-playing program, Proceedings of the 17th international joint conference on Artificial intelligence, p.529-534, August 04-10, 2001, Seattle, WA, USA
|
|
|
|
|
|
|
REVIEW
"Jaak Tepandi : Reviewer"
Complex board games are a natural testing ground for
machine learning and artificial intelligence. They are based on
experience; they are attractive; and they do not have the safety
requirements that sometimes block the use of heur
more...
|