486 references, last updated Wed Nov 5 13:45:41 2003
- [1]
- Bruce Abramson and Richard E. Korf.
A model of two-player evaluation functions.
In Proceedings of the 6th National Conference on Artificial Intelligence
(AAAI-87), pages 90-94. Morgan Kaufmann, 1987.
[Tic-Tac-Toe, Othello] [Statistical] [y]
- [2]
- Bruce Abramson.
Learning expected-outcome evaluators in chess.
In H. Berliner, editor, Proceedings of the AAAI Spring Symposium on
Computer Game Playing, pages 26-28, Stanford University, 1988.
[Chess] [Statistical] [y]
- [3]
- Bruce Abramson.
Expected-outcome: A general model of static evaluation.
IEEE Transactions on Pattern Analysis and Machine Intelligence,
12(2):182-193, 1990.
[Tic-Tac-Toe, Othello, Chess] [Statistical] [y]
- [4]
- Bruce Abramson.
On learning and testing evaluation functions.
Journal of Experimental and Theoretical Artificial Intelligence,
2(3):182-193, 1990.
[] [Statistical] [n]
- [5]
- Myriam Abramson and Harry Wechsler.
Competitive reinforcement learning for combinatorial
problems.
In Proceedings of the IEEE International Joint Conference on Neural
Networks (IJCNN-01), pages 2333-2338, Washington, DC, 2001.
[Go] [Reinforcement] [y]
- [6]
- Jonathan Allen, Edward Hamilton, and
Robert Levinson.
New advances in
adaptive pattern-oriented chess.
In H. J. van den Herik and J. W. H. M. Uiterwijk, editors, Advances in
Computer Chess 8, pages 213-233. Universiteit Maastricht, 1997.
[Chess] [TD, CBR] [y]
- [7]
- Thomas S. Anantharaman.
A Statistical Study of Selective Min-Max Search in Computer Chess.
PhD thesis, Carnegie Mellon University, Pittsburgh, PA, 1990.
University Report CMU-CS-90-173.
[Chess] [Statistical] [y]
- [8]
- Thomas S. Anantharaman.
Evaluation tuning for computer chess: Linear discriminant methods.
International Computer Chess Association Journal, 20(4):224-242,
1997.
[Chess] [Statistical] [y]
- [9]
- Ariel Arbiser.
Game playing learning by parameter adjustment in Escoba.
In H. Matsubara, editor, Proceedings of the 4th Game Programming
Workshop, Tokyo, Japan, 1997. Computer Shogi Association.
[Escoba] [Statistical] [n]
- [10]
- Chris Atkeson.
Memory-based approaches to learning to play games.
In Epstein and Levinson [140],
pages 101-105.
[] [CBR] [y]
- [11]
- Peter J. Angeline and Jordan B.
Pollack.
Evolutionary
induction of subroutines.
In Proceedings of the 14th Annual Cognitive Science Conference,
pages 236-241, 1992.
[Tic-Tac-Toe] [Evolutionary] [y]
- [12]
- Peter J. Angeline and Jordan B.
Pollack.
Coevolving
high-level representations.
In C. Langton, editor, Proceedings of the 3rd Artificial Life
Meeting, 1994.
[Tic-Tac-Toe] [Evolutionary] [y]
- [13]
- Peter J. Angeline and Jordan B.
Pollack.
Competitive
environments evolve better solutions for complex tasks.
In Proceedings of the 5th International Conference on Genetic Algorithms
(GA-93), pages 264-270, 1994.
[Tic-Tac-Toe] [Evolutionary] [y]
- [14]
- Peter Auer, Nicolò Cesa-Bianchi, Yoav
Freund, and Robert E. Schapire.
Gambling in a rigged casino: The adversarial multi-armed bandit problem.
In Proceedings of the 36th Annual Symposium on Foundations of Computer
Science, pages pp. 322-331. ACM Press, 1995.
[Game Theory] [] [n]
- [15]
- J. R. Bachrach.
Connectionist learning in backgammon.
Coins technical report, University of Massachusetts, Amherst, MA, 1986.
[Backgammon] [Neural Network] []
- [16]
- Michael Bain.
Learning optimal KRK strategies.
In S. H. Muggleton and K. Furukawa, editors, Proceedings of the 2nd
International Workshop on Inductive Logic Programming (ILP-92), number
TM-1182 in ICOT Technical Memorandum, pages 188-201, Tokyo, Japan, 1992.
Institue for New Generation Computer Technology.
[Chess] [ILP] [n]
- [17]
- Michael Bain.
Learning Logical Exceptions in Chess.
PhD thesis, Department of Statistics and Modelling Science, University of
Strathclyde, Scotland, 1994.
[Chess] [ILP] [y]
- [18]
- Micheal Bain and Stephen H. Muggleton.
Learning optimal chess strategies.
In K. Furukawa, D. Michie, and S. H. Muggleton, editors, Machine
Intelligence 13, pages 291-310. Oxford University Press, 1994.
[Chess] [ILP] [n]
- [19]
- Michael Bain and Ashwin Srinivasan.
Inductive logic programming with large-scale unstructured data.
In K. Furukawa, D. Michie, and S. H. Muggleton, editors, Machine
Intelligence 14, pages 233-267. Oxford University Press, 1995.
[Chess] [ILP] [n]
- [20]
- Michael Bain, Stephen H. Muggleton, and
Ashwin Srinivasan.
Generalising closed world specialisation: A chess end game application, 1995.
[Chess] [ILP] [y]
- [21]
- Luigi Barone and Lyndon While.
Evolving adaptive play for simplified Poker.
In Proceedings of the International Conference on Evolutionary
Computation (ICEC-98), pages 108-113. IEEE Press, 1998.
[Poker] [Evolutionary] [n]
- [22]
- Luigi Barone and Lyndon While.
An adaptive learning model for simplified Poker using evolutionary
algorithms.
In Proceedings of the 1st Congress on Evolutionary Computation
(CEC-99), pages 153-160, Washington, DC, 1999. IEEE Press.
[Poker] [Evolutionary] [n]
- [23]
- Luigi Barone and Lyndon While.
Adaptive learning for Poker.
In Proceedings of the Genetic and Evolutionary Computation Conference
(GECCO-00), pages 566-573, Las Vegas, Nevada, 2000. Morgan Kaufmann.
[Poker] [Evolutionary] [n]
- [24]
- Eric B. Baum.
How a bayesian approaches games like chess.
In Epstein and Levinson [140],
pages 48-50.
[Chess] [Statistical] [n]
- [25]
- Jonathan Baxter, Andrew Tridgell, and
Lex Weaver.
KnightCap: A chess program that learns by combining TD(lambda) with minimax
search.
Technical report, Department of Systems Engineering, Australian National
University, Canberra, Australia, November 1997.
[Chess] [TD] [y]
- [26]
- Jonathan Baxter, Andrew Tridgell, and
Lex Weaver.
TDLeaf(lambda): Combining temporal difference learning with game-tree
search.
In Proceedings of the 9th Australian Conference on Neural Networks
(ACNN-98), 1998.
[Chess, Backgammon] [TD] [y]
- [27]
- Jonathan Baxter, Andrew Tridgell, and
Lex Weaver.
TDLeaf(lambda): Combining temporal difference learning with game-tree
search.
Australian Journal of Intelligent Information Processing, 1998.
[Chess, Backgammon] [TD] [y]
- [28]
- Jonathan Baxter, Andrew Tridgell, and
Lex Weaver.
A chess program that learns by combining TD(lambda) with game-tree
search.
In Proceedings of the 15th International Conference on Machine Learning
(ICML-98), pages 28-36, Madison, WI, 1998. Morgan Kaufmann.
[Chess] [TD] [y]
- [29]
- Jonathan Baxter, Andrew Tridgell, and
Lex Weaver.
Experiments in parameter learning using temporal differences.
International Computer Chess Association Journal, 21(2):84-99,
1998.
[Chess] [TD] [y]
- [30]
- Jonathan Baxter, Andrew Tridgell, and
Lex Weaver.
Learning to play chess
using temporal differences.
Machine Learning, 40(3):243-263, September 2000.
[Chess, Backgammon] [TD] [y]
- [31]
- Jonathan Baxter, Andrew Tridgell, and
Lex Weaver.
Reinforcement learning and chess.
In Fürnkranz and Kubat [197], chapter 5, pages 91-116.
[Chess] [TD] [y]
- [32]
- Donald F. Beal and Martin C. Smith.
Learning piece
values using temporal difference learning.
International Computer Chess Association Journal, 20(3):147-151,
September 1997.
[Chess] [TD] [y]
- [33]
- Donald F. Beal and Martin C. Smith.
First results from using temporal difference learning in Shogi.
In H. J. van den Herik and H. Iida, editors, Proceedings of the First
International Conference on Computers and Games (CG-98), volume 1558
of Lecture Notes in Computer Science, page 113, Tsukuba, Japan,
1998. Springer-Verlag.
[Shogi] [TD] [y]
- [34]
- Donald F. Beal and Martin C. Smith.
Temporal coherence and prediction decay in td learning.
In Proceedings of the 16th International Joint Conference on Artificial
Intelligence (IJCAI-99), pages 564-569, 1999.
[Chess] [TD] [y]
- [35]
- Donald F. Beal and Martin C. Smith.
Temporal difference learning for heuristic search and game playing.
Information Sciences, 122(1):3-21, 2000.
Special Issue on Heuristic Search and Computer Game Playing.
[] [TD] [n]
- [36]
- Donald F. Beal and Martin C. Smith.
Temporal difference learning applied to game playing and the results of
application to Shogi.
Theoretical Computer Science, 252(1-2):105-119, 2001.
Special Issue on Papers from the Computers and Games 1998 Conference.
[Shogi] [TD] [n]
- [37]
- Donald F. Beal.
Learning to play well from observing bad play (abstract).
In Jos W. H. M. Uiterwijk, editor, Proceedings of the 6th Computer
Olympiad Computer-Games Workshop, Maastricht, NL, August 2001. IKAT,
Department of Computer Science, Universiteit Maastricht.
Technical Report CS 01-04.
[Chess] [] [n]
- [38]
- Dimitri P. Bertsekas and John N.
Tsitsiklis.
Neuro-Dynamic
Programming.
Athena Scientific, Belmont, MA, 1996.
[Tetris, Backgammon] [Reinforcement, Neural Network]
[n]
- [39]
- Dimitri P. Bertsekas and Sergey
Ioffe.
Temporal
differences-based policy iteration and applications in neuro-dynamic
programming.
Neural Computation, 1998.
To appear.
[Tetris] [Reinforcement, Neural Network] [y]
- [40]
- Lawrence Birnbaum, Gregg Collins,
Michael Freed, and Bruce Krulwich.
Issues in the justification-based diagnosis of planning failures.
In Proceedings of the 6th International Workshop on Machine Learning
(ML-89), pages 194-196. Morgan Kaufmann, 1989.
[Chess] [CBR] [y]
- [41]
- Darse Billings, Denis Papp, Jonathan
Schaeffer, and Duane Szafron.
Opponent modeling in poker.
In Proceedings of the 15th National Conference on Artificial Intelligence
(AAAI-98), pages 493-498, Madison, WI, 1998. AAAI Press.
[Poker] [Statistical] [y]
- [42]
- Darse Billings.
Thoughts on RoShamBo.
International Computer Games Association Journal, 23(1):3-8,
March 2000.
[RoShamBo] [] [y]
- [43]
- Darse Billings.
The first international RoShamBo programming competition.
International Computer Games Association Journal, 23(1):42-50,
March 2000.
[RoShamBo] [Statistical] [y]
- [44]
- Darse Billings, Lourdes Pe~na,
Jonathan Schaeffer, and Duane Szafron.
Learning to play strong poker.
In Fürnkranz and Kubat [197], chapter 11, pages 225-242.
[Poker] [] [y]
- [45]
- Darse Billings, Lourdes Pe~na,
Jonathan Schaeffer, and Duane Szafron.
The challenge
of poker.
Artificial Intelligence, 134(1-2):201-240, January 2002.
Special Issue on Games, Computers and Artificial Intelligence.
[Poker] [Neural Network] [y]
- [46]
- Lawrence Birnbaum, Gregg Collins,
Michael Freed, and Bruce Krulwich.
Model-based diagnosis of planning failures.
In Proceedings of the 8th National Conference on Artificial Intelligence
(AAAI-90), pages 318-323, 1990.
[Chess] [CBR] [y]
- [47]
- Yngvi Björnsson and T. Anthony
Marsland.
Learning search control in adversary games.
In H. J. van den Herik and B. Monien, editors, Advances in Computer
Games 9, pages 157-174. Universiteit Maastricht, Paderborn, Germany,
2001.
[] [Gradient Descent] [y]
- [48]
- Alan D. Blair and Jordan B. Pollack.
What makes a good
co-evolutionary learning environment?.
Australian Journal of Intelligent Information Processing Systems,
4:166-175, 1997.
[Backgammon] [Evolutionary, Neural Network] [y]
- [49]
- Bruno Bouzy and Tristan Cazenave.
Computer Go: An AI-oriented survey.
Artificial Intelligence, 132(1):39-103, 2001.
[Go] [] [y]
- [50]
- Justin A. Boyan.
Modular neural networks for learning context-dependent game
strategies.
Master's thesis, University of Cambridge, Department of Engineering and
Computer Laboatory, 1992.
[Backgammon, Tic-Tac-Toe] [TD] [y]
- [51]
- Justin A. Boyan and Andrew W. Moore.
Robust value
function approximation by working backwards.
In J. A. Boyan, A. W. Moore, and R. S. Sutton, editors, Proceedings of
the ML-95 Workshop on Value Function Approximation. Carnegie Mellon
University, Technical Report CMU-CS-95-206, July 1995.
[Pig] [Reinforcement] [y]
- [52]
- Justin A. Boyan and Andrew W. Moore.
Safely approximating the value function.
In G. Tesauro, D. S. Touretzky, and T. K. Leen, editors, Advances in
Neural Information Processing Systems 7 (NIPS-94). Morgan Kaufmann,
1995.
[Tic-Tac-Toe] [TD, Neural Network, Statistical] [y]
- [53]
- Justin A. Boyan and Andrew W. Moore.
Learning evaluation functions for large acyclic domains.
In L. Saitta, editor, Proceedings of the 13th International Conference on
Machine Learning, Bari, Italy, 1996. Morgan Kaufmann.
[Pig] [Reinforcement] [y]
- [54]
- Ronen I. Brafman and Moshe Tennenholtz.
A near-optimal polynomial
time alogorithm for learning in stochastic games.
In Proceedings of the 16th International Joint Conference on Artificial
Intelligence (IJCAI-99), pages 734-739, 1999.
[Game Theory] [Reinforcement] [y]
- [55]
- M. A. Bramer.
Representation of Knowledge for Chess Endgames: Towards a Self-Improving
System.
PhD thesis, The Open University, Milton Keynes, U.K., 1977.
[Chess] [Inductive] [n]
- [56]
- M. A. Bramer.
Machine-aided refinement of correct strategies for the endgame in chess.
In M. R. B. Clarke, editor, Advances in Computer Chess 3, pages
93-112. Pergamon Press, 1982.
[Chess] [Inductive] [y]
- [57]
- Ivan Bratko, P. Tancig, and S. Tancig.
Detection of positional patterns in chess.
International Computer Chess Association Journal, 7(2):63-73,
1984.
[Chess] [] [n]
- [58]
- Ivan Bratko, P. Tancig, and S. Tancig.
Detection of positional patterns in chess.
In D. F. Beal, editor, Advances in Computer Chess 4, pages
113-126. Pergamon Press, 1986.
[Chess] [] [y]
- [59]
- Bernd Brügmann.
Monte Carlo Go.
Available from ftp://ftp.cse.cuhk.edu.hk/pub/neuro/GO/mcgo.tex, March
1993.
Unpublished manuscript.
[Go] [Statistical] [y]
- [60]
- Michael Buro.
Techniken für die Bewertung von Spielsituationen anhand von
Beispielen.
PhD thesis, Universität-GH-Paderborn, Fachbereich 17 ---
Mathematik/Informatik, 1994.
In German.
[Othello] [Statistical] [y]
- [61]
- Michael Buro.
Statistical feature combination for the evaluation of game positions.
Journal of Artificial Intelligence Research, 3:373-382, 1995.
[Othello] [Statistical] [y]
- [62]
- Michael Buro.
ProbCut: An effective selective extension of the alpha -beta algorithm.
International Computer Chess Association Journal, 18(2):71-76,
1995.
[Othello] [Statistical] [y]
- [63]
- Michael Buro.
Toward opening book
learning.
In H. Iida, J. Schaeffer, J. W. H. M. Uiterwijk, and Y. Saito, editors,
Proceedings of the IJCAI-97 Workshop on Using Games as an Experimental
Testbed for AI Research, Nagoya, Japan, 1997.
[Othello] [Rote Learning] [y]
- [64]
- Michael Buro.
From simple
features to sophisticated evaluation functions.
In H. J. van den Herik and H. Iida, editors, Proceedings of the First
International Conference on Computers and Games (CG-98), volume 1558
of Lecture Notes in Computer Science, pages 126-145, Tsukuba,
Japan, 1998. Springer-Verlag.
[Othello] [Constructive Induction] [y]
- [65]
- Michael Buro.
Is one
neuron really enough to play games at world-championship level? or how
machines have learned to play othello.
In Fürnkranz and Kubat [195].
Extended Abstract.
[Othello] [Constructive Induction] [y]
- [66]
- Michael Buro.
Toward opening book learning.
International Computer Chess Association Journal, 22(2):98-102,
1999.
Research Note.
[Othello] [] [y]
- [67]
- Michael Buro.
How machines have
learned to play Othello.
IEEE Intelligent Systems, 14(6):12-14, November/December 1999.
Research Note.
[Othello] [Statistical] [y]
- [68]
- Michael Buro.
Toward opening book learning.
In H. J. van den Herik and H. Iida, editors, Games in AI Research,
pages 47-54. Universiteit Maastricht, 2000.
[Othello] [Rote Learning] [y]
- [69]
- Michael Buro.
Experiments with
Multi-ProbCut and a new high-quality evaluation function for Othello.
In H. J. van den Herik and H. Iida, editors, Games in AI Research,
pages 77-96. Universiteit Maastricht, 2000.
[Othello] [Statistical] [y]
- [70]
- Michael Buro.
Toward opening book learning.
In Fürnkranz and Kubat [197], chapter 4, pages 81-89.
[Othello] [Rote Learning] [y]
- [71]
- Michael Buro.
Improving
heuristic mini-max search by supervised learning.
Artificial Intelligence, 134(1-2):85-99, January 2002.
Special Issue on Games, Computers and Artificial Intelligence.
[Othello] [Constructive Induction, Statistical, Rote Learning]
[y]
- [72]
- Michael Buro.
The evolution
of strong Othello programs.
In Proceedings of the International Workshop on Entertainment computing
(IWEC-02), Makuhari, Japan, 2002.
[Othello] [Constructive Induction, Statistical] [y]
- [73]
- James P. Callan, Tom Elliott Fawcett,
and Edwina L. Rissland.
CABOT: An
adaptive approach to case-based search.
In Proceedings of the 12th International Conference on Artificial
Intelligence, pages 803-809, San Mateo, CA, 1991. Morgan Kaufmann.
[Othello] [CBR] [y]
- [74]
- James P. Callan, Tom Elliott Fawcett,
and Edwina L. Rissland.
Adaptive case-based reasoning.
In Proceedings: Case-Based Reasoning Workshop, pages 179-190, San
Mateo, CA, May 1991. Morgan Kaufmann.
[Othello] [CBR] [y]
- [75]
- Murray S. Campbell.
Knowledge discovery in Deep Blue.
Communications of the ACM, 42(11):65-67, November 1999.
[Chess] [] [y]
- [76]
- Murray Campbell, A. Joseph Hoane
Jr., and Feng hsiung Hsu.
Deep blue.
Artificial Intelligence, 134(1-2):57-83, January 2002.
Special Issue on Games, Computers and Artificial Intelligence.
[Chess] [Comparison Training] [y]
- [77]
- Richard Cant, Julian Churchill, and David
Al-Dabass.
Using
hard and soft artificial intelligence algorithms to simulate human Go
playing techniques.
International Journal of Simulation, 2(1):31-49, 2001.
[Go] [Neural Network] [y]
- [78]
- David Carmel and Shaul Markovitch.
Learning models of opponent's strategy in game playing.
In Epstein and Levinson [140],
pages 140-147.
[Checkers] [] [y]
- [79]
- David Carmel and Shaul Markovitch.
Learning models of intelligent agents.
In Proceedings of the 13th National Conference on Artificial Intelligence
(AAAI-96), pages 62-67. AAAI Press, 1996.
[Game Theory] [Automata] [y]
- [80]
- David Carmel and Shaul Markovitch.
Exploration and adaptation in multiagent systems: A model-based
approach.
In Proceedings of the 15th Joint International Conference on Artificial
Intelligence (IJCAI-97), 1997.
[Game Theory] [Automata] [y]
- [81]
- David Carmel and Shaul Markovitch.
How to explore your opponent's strategy (almost) optimally.
In Proceedings of the International Conference on Multi Agent
Systems, Paris, France, 1998.
[Game Theory] [] [y]
- [82]
- David Carmel and Shaul Markovitch.
Model-based learning of interaction strategies in multiagent systems.
Journal of Experimental and Theoretical Artificial Intelligence,
10(3):309-332, July 1998.
[Game Theory] [Automata, Reinforcement] [y]
- [83]
- David Carmel and Shaul Markovitch.
Exploration strategies for model-based learning in multi-agent systems: Exploration
strategies.
Autonomous Agents and Multi-Agent Systems, 2(2):141-172, June
1999.
[Game Theory] [Automata] [y]
- [84]
- Tristan Cazenave.
Learning to
forecast by explaining the consequences of action.
In Proceedings of the Workshop on Machine Learning, Forecasting and
Optimization, Madrid, 1996.
[Go] [EBL] [y]
- [85]
- Tristan Cazenave.
Automatic
acquisition of tactical Go rules.
In H. Matsubara, editor, Proceedings of the 3rd Game Programming
Workshop, Hakone, Japan, 1996.
[Go] [EBL] [y]
- [86]
- Tristan Cazenave.
Systeme
d'Apprentissage par Auto-Observation. Application au Jeu de Go.
PhD thesis, Universite Pierre et Marie Curie, Paris, France, 1996.
In French.
[Go] [EBL] [y]
- [87]
- Tristan Cazenave.
Integration of different reasoning modes in a Go playing and learning system.
In E. Freuder, editor, Proceedings of the AAAI Spring Symposium on
Multimodal Reasoning, Stanford, CA, 1998. AAAI Press.
Technical Report SS-98-04.
[Go] [EBL] [n]
- [88]
- Tristan Cazenave.
Metaprogramming
forced moves.
In H. Prade, editor, Proceedings of the 13th European Conference on
Artificial Intelligence (ECAI-98), pages 645-649, Brighton, U.K.,
1998. Wiley.
[Go] [EBL] [y]
- [89]
- Tristan Cazenave.
Synthesis of an
efficient tactical theorem prover for the game of go.
ACM Computing Surveys, 3es, September 1998.
Special Issue on the 1998 Symposium on Partial Evaluation.
[Go] [EBL] [y]
- [90]
- Tristan Cazenave.
Generation of
patterns with external conditions for the game of Go.
In H. J. van den Herik and B. Monien, editors, Advances in Computer
Games 9, pages 275-293, Paderborn, Germany, 2001. Universiteit
Maastricht.
[Go] [EBL] [y]
- [91]
- Horace Wai-Kit Chan, Irwin Kuo-Chin King,
and John C. S. Lui.
Performance
analysis of a new updating rule for TD( lambda ) learning in feedforward
networks for position evaluation in Go.
In Proceedings of the IEEE International Conference on Neural
Networks, volume III, pages 1716-1720, Washington, DC, 1996. IEEE
Computer Society.
[Go] [TD, Neural Network] [y]
- [92]
- Horace Wai-Kit Chan.
Application of
temporal difference learning and supervised learning in the game of Go.
Master's thesis, The Chinese University of Hong Kong, 1996.
[Go] [TD, Neural Network] [y]
- [93]
- Kumar Chellapilla and David B.
Fogel.
Co-evolving checkers playing programs using only win, lose, or
draw.
In Proceedings of SPIE's AeroSense'99: Applications and Science of
Computational Intelligence II, Orlando, FL, April 1999.
[Checkers] [Evolutionary, Neural Network] [y]
- [94]
- Kumar Chellapilla and David B.
Fogel.
Evolution, neural networks, games, and intelligence.
In Proceedings of the IEEE, volume 87, pages 1471-1496, 1999.
[Checkers] [Evolutionary, Neural Network] [y]
- [95]
- Kumar Chellapilla and David B.
Fogel.
Evolving neural networks to play checkers without expert
knowledge.
IEEE Transactions on Neural Networks, 10(6):1382-1391, 1999.
[Checkers] [Evolutionary, Neural Network] [y]
- [96]
- Kumar Chellapilla and David B.
Fogel.
Anaconda defeats Hoyle 6-0: A case study competing an evolved
checkers program against commercially available software.
In Proceedings of the 2nd Congress on Evolutionary Computation
(CEC-00), pages 857-863, Piscataway, NJ, 2000. IEEE Press.
[Checkers] [Evolutionary, Neural Network] [y]
- [97]
- C. Cheng.
Recognizing poker hands with genetic programming and restricted iteration.
In J. Koza, editor, Genetic Algorithms and Genetic Programming at
Stanford. Stanford, CA, 1997.
[Poker] [Evolutionary] [n]
- [98]
- Ping-Chung Chi and Dana S. Nau.
Improving game board evaluator with genetic algorithms.
In H. Berliner, editor, Proceedings of the AAAI Spring Symposium on
Computer Game Playing, pages 29-30, Stanford University, 1988.
[Kalah] [Evolutionary] [y]
- [99]
- J. Christensen and Richard E. Korf.
A unified theory of heuristic evaluation functions and its application to
learning.
In Proceedings of the 4th National Conference on Artificial
Intelligence, pages 148-152, 1986.
[] [] [y]
- [100]
- J. Christensen.
Learning static evaluation functions by linear regression.
In T. Mitchell, J. Carbonell, and R. Michalski, editors, Machine
learning: A guide to current research, pages 39-42. Kluwer, 1986.
[Chess] [Statistical] [y]
- [101]
- Julian Churchill, Richard Cant, and
David Al-Dabass.
A new
computational approach to the game of Go.
In Proceedings of the 2nd Annual European Conference on Simulation and AI
in Computer Games (GAME-ON-01), pages 81-86, London, 2001.
[Go] [Neural Network] [y]
- [102]
- William W. Cohen.
Learning from textbook knowledge: A case study.
In Proceedings of the 8th National Conference on Artificial
Intelligence, Boston, Massachusetts, 1990. AAAI, MIT Press.
[Bridge] [EBL] [y]
- [103]
- William W. Cohen.
Abductive
explanation-based learning: A solution to the multiple inconsistent
explanation problem.
Machine Learning, 8:167-219, 1992.
[Bridge] [EBL] [y]
- [104]
- Gregg Collins, Lawrence Birnbaum, and
Bruce Krulwich.
An adaptive model of decision-making in planning.
In Proceedings of the 11th International Joint Conference on Artificial
Intelligence (IJCAI-89), pages 511-516. Morgan Kaufmann, 1989.
[Chess] [CBR] [y]
- [105]
- Gregg Collins, Lawrence Birnbaum,
Bruce Krulwich, and Micheal Freed.
Plan debugging in an intentional system.
In Proceedings of the 12th International Joint Conference on Artifical
Intelligence (IJCAI-91), pages 353-359. Morgan Kaufmann, 1991.
[Chess] [CBR] [y]
- [106]
- Gregg Collins, Lawrence Birnbaum,
Bruce Krulwich, and Micheal Freed.
Model-based integration of planning and learning.
SIGART Bulletin, 2(1):56-60, 1991.
[Chess] [CBR] [y]
- [107]
- Gregg Collins, Lawrence Birnbaum,
Bruce Krulwich, and Michael Freed.
The role of self-models in learning to plan.
In A. L. Meyrowitz and S. Chipman, editors, Foundations of Knowledge
Acquisition: Machine Learning, pages 83-116. Kluwer Academic
Publishers, Boston, 1993.
[Chess] [CBR] [y]
- [108]
- K. P. Coplan.
Synthesis of chess and chess-like endgames by recursive optimisation.
International Computer Chess Journal, 21(3):169-182, 1998.
[Chess] [Deductive] [y]
- [109]
- K. P. Coplan.
Synthesis of chess-like endgames: Towards a proof of correctness.
In H. J. van den Herik and B. Monien, editors, Advances in Computer
Games 9, pages 143-156. Universiteit Maastricht, Paderborn, Germany,
2001.
[Chess] [Deductive] [y]
- [110]
- Fredrik A. Dahl.
Honte,
a go-playing program using neural nets.
In Fürnkranz and Kubat [195].
[Go] [Neural Network] [y]
- [111]
- Fredrik A. Dahl and Ole Martin Halck.
Minimax TD-learning with neural nets in a markov game.
In R. López de Mántaras and E. Plaza, editors, Proceedings of the
11th European Conference on Machine Learning (ECML-00), pages
117-128, Barcelona, Spain, 2000. Springer-Verlag.
[Game Theory] [TD, Neural Network] [y]
- [112]
- Fredrik A. Dahl.
Honte, a go-playing program using neural nets.
In Fürnkranz and Kubat [197], chapter 10, pages 205-223.
[Go] [Neural Network] [y]
- [113]
- Fredrik A. Dahl.
A reinforcement learning algorithm applied to simplified two-player texas
hold'em poker.
In L. De Raedt and P. Flach, editors, Proceedings of the 12th European
Conference on Machine Learning (ECML-01), pages 85-96, Freiburg,
Germany, September 2001. Springer-Verlag.
[Poker] [Reinforcement] [y]
- [114]
- Fredrik A. Dahl.
The lagging anchor algorithm: Reinforcement learning in two-player zero-sum
games with imperfect information.
Machine Learning, 49(1):5-37, October 2002.
[Game Theory, Poker] [Reinforcement] [y]
- [115]
- Paul Darwen and Xin Yao.
On evolving robust
strategies for iterated prisoner's dilemma.
In Progress in Evolutionary Computation, pages 276-292.
Springer-Verlag, 1995.
[Game Theory] [Evolutionary] [y]
- [116]
- Paul J. Darwen.
Unobtrusive workstation
farming without inconveniencing owners: Learning backgammon with a genetic
algorithm.
In IEEE International Workshop on Cluster Computing, pages
303-311, Melbourne, Australia, 1999. IEEE Computer Society Press.
[Backgammon] [Evolutionary] [y]
- [117]
- Paul J. Darwen.
Computationally
intensive and noisy tasks: Co-evolutionary learning and temporal difference
learning on backgammon.
In Proceedings of the 2000 Congress on Evolutionary Computation
(CEC-00), pages 872-879, San Diego, CA, 2000.
[Backgammon] [Evolutionary, Reinforcement] [y]
- [118]
- Paul Darwen.
Why co-evolution
beats temporal-difference learning at backgammon for a linear architectore,
but not a non-linear architecture.
In Proceedings of the 2001 Congress on Evolutionary Computation
(CEC-01), pages 1003-1010, Seoul Korea, 2001.
[Backgammon] [Evolutionary, Reinforcement] [y]
- [119]
- Paul Darwen and Xin Yao.
Co-evolution in iterated
prisoner's dilemma with intermediate levels of cooperation: Application to
missile defense.
International Journal of Computational Intelligence and
Applications, 2(1):87-107, March 2002.
[Game Theory] [Evolutionary] [y]
- [120]
- Aaron Davidson, Darse Billings,
Jonathan Schaeffer, and Duane Szafron.
Improved opponent modelling in poker.
In Proceedings of the International Conference on Artificial Intelligence
(ICAI-2000), pages 1467-1473, Las Vegas, Nevada, 2000.
[Poker] [Statistical] [y]
- [121]
- James Edward Davis and Graham Kendall.
An
investigation, using co-evolution, to evolve an Awari player.
In Proceedings of the Congress on Evolutionary Computation
(CEC-02), Honolulu, Hawaii, 2002. IEEE Press.
[Awari] [Evolutionary] [y]
- [122]
- Morton Davis.
On artificial machine learning: Some ideas in search of a theory.
International Journal of Computer Mathematics, 5:315-329, 1976.
[Hex] [Statistical] [n]
- [123]
- Morton Davis.
Computer learning of parlor games.
Physica D, 22:351-354, 1986.
Also published in D. Farmer, A. Lapedes, N. Packard, and B. Wendroff (eds.)
Evolution, Games and Learning: Models for Adaptation in Machine and
Nature, North-Holland, 1986.
[Hex] [Statistical] [y]
- [124]
- Dennis DeCoste.
The future of chess-playing technologies and the significance of Kasparov
versus Deep Blue.
In Deep Blue Versus Kasparov: The Significance for Artificial
Intelligence: Papers from the 1997 AAAI Workshop, pages 9-13. AAAI
Press, 1997.
Technical Report WS-97-04.
[Chess] [Statistical] [y]
- [125]
- Dennis DeCoste.
The significance of Kasparov versus Deep Blue and the future of computer
chess.
International Computer Chess Association Journal, 21(1):33-43,
March 1998.
Research Note.
[Chess] [Statistical] [y]
- [126]
- Kenneth A. DeJong and Alan C. Shultz.
Using
experience-based learning in game-playing.
In Proceedings of the 5th International Conference on Machine
Learning, pages 284-290, 1988.
[Othello] [CBR] [y]
- [127]
- Thomas G. Dietterich and
Nicholas S. Flann.
Explanation-based and reinforcement learning: A unified view.
In Proceedings of the 12th International Conference on Machine
Learning, pages 176-184, Tahoe City, CA, 1995. Morgan Kaufmann.
[Chess] [Reinforcement, EBL] [y]
- [128]
- Thomas G. Dietterich and
Nicholas S. Flann.
Explanation-based
and reinforcement learning: A unified view.
Machine Learning, 28(2/3):169-210, 1997.
[Chess] [Reinforcement, EBL] [y]
- [129]
- Paul Donnelly, Patrick Corr, and Danny
Crookes.
Evolving Go playing
strategy in neural networks.
[Go] [Neural Network] [y]
- [130]
- Len Dorfman and Narendra K. Ghosh.
Developing Games That
Learn.
Manning Publications Co., 1996.
[Tic-Tac-Toe, Connect-Four] [] [n]
- [131]
- Dan Egnor.
Iocaine Powder.
International Computer Games Association Journal, 23(1):33-35,
March 2000.
Resarch Note.
[RoShamBo] [Statistical] [y]
- [132]
- Ntoutsi Eirini and Dimitrious Kalles.
Game design
verification using reinforcement learning.
In Proceedings of the 2nd Hellenic Conference on Artificial Intelligence
(SETN-2), 2002.
[] [Reinforcement, Neural Network] [y]
- [133]
- Herbert D. Enderton.
The
Golem Go program.
Technical Report CMU-CS-92-101, School of Computer Science, Carnegie-Mellon
University, December 1991.
[Go] [Neural Network] [y]
- [134]
- Thomas M. English.
Learning to focus selectively on possible lines of play in checkers.
In Proceedings of the 2001 Congress on Evolutionary Computation
(CEC-01), pages 1019-1024, Seoul, Korea, 2001. IEEE Press.
[Checkers] [Evolutionary] [n]
- [135]
- Markus Enzenberger.
The
integration of a priori knowledge into a Go playing neural network,
September 1996.
Unpublished Manuscript.
[Go] [Neural Network] [y]
- [136]
- Susan L. Epstein.
The intelligent novice: Learning to play better.
In D. N. Levy and D. F. Beal, editors, Heuristic Programming in
Artificial Intelligence --- The First Computer Olympiad. Ellis
Horwood, Chichester, England, 1989.
[] [] [n]
- [137]
- Susan L. Epstein.
Learning plans for competitive domains.
In Proceedings of the 7th International Conference on Machine Learning
(ICML-90), pages 190-197, 1990.
[] [] [y]
- [138]
- Susan L. Epstein.
Prior
knowledge strengthens learning to control search in weak theory domains.
International Journal of Intelligent Systems, 7:547-586, 1992.
[] [Rote Learning] [n]
- [139]
- Susan L. Epstein.
The role of
memory and concepts in learning.
Minds and Machines, 2:239-265, 1992.
[Tic-Tac-Toe] [] [y]
- [140]
- Susan L. Epstein and Robert A.
Levinson, editors.
Proceedings of the AAAI Fall Symposium on Intelligent Games: Planning
and Learning, number FS-93-02, Menlo Park, CA, 1993. The AAAI
Press.
[] [] [n]
- [141]
- Susan L. Epstein, Jack J. Gelfand,
Joanna Lesniak, and Pascal Abadie.
The integration of visual-cues into a multiple-advisor game-learning program.
In Epstein and Levinson [140],
pages 92-100.
[] [] [n]
- [142]
- Susan L. Epstein, Pascal Abadie,
Joanna Lesniak, and Jack J. Gelfand.
Thinking and seeing in game playing: Integrating pattern recognition and
symbolic learning.
In R. S. Michalski and G. Tecuci, editors, Proceedings of the Second
International Workshop on Multistrategy Learning, pages 301-308,
Harpers Ferry, W.VA., 1993.
[Mill] [] [y]
- [143]
- Susan L. Epstein.
Toward an
ideal trainer.
Machine Learning, 15:251-277, 1994.
[Tic-Tac-Toe, Achi] [] [y]
- [144]
- Susan L. Epstein.
Hard questions about easy tasks --- issues from learning to play games.
In Computational Learning Theory and Natural Learning Systems:
Constraints and Prospects. The MIT Press, 1994.
[] [] [n]
- [145]
- Susan L. Epstein.
For the
right reasons: The FORR architecture for learning in a skill domain.
Cognitive Science, 18(3):479-511, 1994.
[] [] [y]
- [146]
- Susan L. Epstein.
Identifying the right reasons: Learning to filter decision makers.
In R. Greiner and D. Subramanian, editors, Proceedings of the AAAI Fall
Symposium on Relevance, pages 68-71. AAAI Press, 1994.
Technical Report FS-94-02.
[] [] [y]
- [147]
- Susan L. Epstein and Jack J. Gelfand.
Learning new spatially-oriented game-playing agents through experience.
In Proceedings of the Seventeenth Annual Conference of the Cognitive
Science Society, pages 562-567, Pittsburgh, 1995. Lawrence Erlbaum
Associates.
[Tic-Tac-Toe, Mill] [] [y]
- [148]
- Susan L. Epstein.
Learning in the right places.
Journal of the Learning Sciences, 4(3):281-319, 1995.
[] [] [n]
- [149]
- Susan L. Epstein, Jack J. Gelfand, and
Joanna Lesniak.
Pattern-based learning and spatially-oriented concept formation in a multi-agent,
decision-making expert.
Computational Intelligence, 12(1):199-221, 1996.
[Tic-Tac-Toe, Mill] [] [y]
- [150]
- Susan L. Epstein and Jenngang Shih.
Learning from sequential examples: Initial results with instance-based
learning.
In D. Aha and D. Wettschereck, editors, ECML-97 Workshop Notes on
Case-Based Learning: Beyond Classification of Feature Vectors, pages
33-40, 1997.
[Bridge] [CBR] [y]
- [151]
- Susan L. Epstein, Jack J. Gelfand, and
Esther Twersky Lock.
Learning game-specific spatially-oriented heuristics.
Constraints, 3:239-253, 1998.
[] [] [n]
- [152]
- Susan L. Epstein, Jack J. Gelfand,
and Esther Twersky Lock.
Learning game-specific spatially-oriented heuristics.
In S. Sen, editor, Satisficing Models: Papers from the 1998 AAAI Spring
Symposium, pages 19-26. AAAI Press, 1998.
Technical Report SS-98-05.
[] [] [n]
- [153]
- Susan L. Epstein.
Learning to play expertly: A tutorial on hoyle.
In Fürnkranz and Kubat [197], chapter 8, pages 153-178.
[] [] [y]
- [154]
- Mark J. Fasciano.
Real-time case-based reasoning in a complex world.
Technical Report TR-96-05, Computer Science Department, University of Chicago,
1996.
[SimCity] [CBR] [y]
- [155]
- Mark J. Fasciano.
Everyday-world plan use.
Technical Report TR-96-07, Computer Science Department, University of Chicago,
1996.
[SimCity] [CBR] [y]
- [156]
- Tom Elliott Fawcett.
Feature discovery for inductive concept learning.
Technical Report UM-CS-1990-015, Department of Computer Science, University of
Massachusetts, 1990.
[Othello] [Inductive, EBL] [y]
- [157]
- Tom Elliott Fawcett.
A hybrid theory of feature generation.
Technical Report UM-CS-1991-008, Department of Computer Science, University of
Massachusetts, June 1991.
[Othello] [Inductive, EBL] [y]
- [158]
- Tom Elliott Fawcett and Paul E.
Utgoff.
A hybrid method for feature construction.
In L. A. Birnbaum and G. C. Collins, editors, Proceedings of the 8th
International Workshop on Machine Learning, pages 137-141, Evanston,
IL, 1991. Morgan Kaufmann.
[Othello] [Inductive, EBL] [y]
- [159]
- Tom Elliott Fawcett and Paul E.
Utgoff.
Automatic feature generation for problem solving systems.
In D. Sleeman and P. Edwards, editors, Proceedings of the 9th
International Conference on Machine Learning, pages 144-153. Morgan
Kaufmann, 1992.
[Othello] [Inductive, EBL] [y]
- [160]
- Tom Elliott Fawcett.
Feature Discovery for Problem Solving Systems.
PhD thesis, Department of Computer Science, University of Massachusetts,
Amherst, MA, 1993.
[Othello] [Inductive, EBL] [y]
- [161]
- Itamar Faybish.
Applying the genetic
algorithm to the game of Othello.
Master's thesis, Vrije Universiteit Brussel, Computer Science Department,
Brussels, Belgium, 1999.
[Othello] [Evolutionary] [y]
- [162]
- Gabriel J. Ferrer and Worthy N. Martin.
Using
genetic programming to evolve board evaluation functions.
In Proceedings of the 1995 IEEE Conference on Evolutionary
Computation, Perth, Australia, 1995.
[Senet] [Evolutionary] [y]
- [163]
- Gabriel J. Ferrer.
Using
genetic programming to evolve board evaluation functions.
Master's thesis, Department of Computer Science, School of Engineering and
Applied Science, University of Virginia, Charlottesville, VA, August 1996.
[Othello, Senet] [Evolutionary] [y]
- [164]
- Nicholas V. Findler.
Studies in machine cognition using the game of poker.
Communications of the ACM, 20(4):230-245, April 1977.
[Poker] [] [n]
- [165]
- Nicholas V. Findler.
Computer poker.
Scientific American, pages 112-119, 1978.
[Poker] [] [n]
- [166]
- Nicholas V. Findler, George L.
Sicherman, and Bede McCall.
A multi-strategy gaming environment.
In M. A. Bramer, editor, Computer Game-Playing: Theory and
Practice, chapter 17, pages 229-255. Ellis Horwood, Chichester,
England, 1983.
[Poker] [] [y]
- [167]
- Lev Finkelstein and Shaul
Markovitch.
Learning to
play chess selectively by acquiring move patterns.
International Computer Chess Association Journal, 21(2):100-119,
June 1998.
[Chess] [] [y]
- [168]
- Nicholas S. Flann and Thomas G.
Dietterich.
Selecting appropriate representations for learning from examples.
In Proceedings of the 4th National Conference on Artificial
Intelligence, pages 460-466, 1986.
[Checkers] [Inductive] [y]
- [169]
- Nicholas S. Flann and Thomas G.
Dietterich.
A study of
explanation-based methods for inductive learning.
Machine Learning, 4:187-226, 1989.
[Chess] [EBL, Inductive] [y]
- [170]
- Nicholas S. Flann.
Learning appropriate abstractions for planning in formation problems.
In A. M. Segre, editor, Proceedings of the 6th International Workshop on
Machine Learning, pages 235-239. Morgan Kaufmann, 1989.
[Chess] [EBL] [y]
- [171]
- Nicholas S. Flann.
Applying abstraction and simplification to learn in intractable domains.
In B. W. Porter and R. Mooney, editors, Proceedings of the 7th
International Conference on Machine Learning, pages 277-285. Morgan
Kaufmann, 1990.
[Chess] [EBL] [y]
- [172]
- Nicholas S. Flann.
Correct Abstraction in Counter-Planning: A Knowledge-Compilation
Approach.
PhD thesis, Oregon State University, 1992.
[Chess, Checkers] [EBL, Reinforcement] [y]
- [173]
- Marshall G. Flax, Jack J. Gelfand,
Stephen H. Lane, and David A. Handelman.
Integrating neural network and tree search approaches to produce an
auto-supervised system that learns to play games.
In Proceedings of the Aerospace Applications of Artificial Intelligence
Conference, 1990.
[] [Neural Network] [n]
- [174]
- Marshall G. Flax, Jack J. Gelfand,
Stephen H. Lane, and David A. Handelman.
Integrating neural network and tree search approaches to produce an
auto-supervised system that learns to play games.
In Proceedings of the International Joint Conference on Neural
Networks, 1992.
[] [Neural Network] [n]
- [175]
- Evan Fletcher and Armand Prieditis.
Learning approximately-admissible heuristics in two-player games.
Machine Learning, 1994.
submitted.
[Tic-Tac-Toe] [Neural Network] [y]
- [176]
- Stephen Flinter and Mark T. Keane.
On
the automatic generation of case libraries by chunking chess games.
In M. Veloso and A. Aamodt, editors, Proceedings of the 1st International
Conference on Case Based Reasoning (ICCBR-95), pages 421-430.
Springer Verlag, 1995.
[Chess] [CBR] [y]
- [177]
- David B. Fogel.
Using evolutionary programming to construct neural networks that are capable of
playing tic-tac-toe.
In Proceedings of the IEEE International Conference on Neural Networks
(ICNN-93), pages 875-879, San Francisco, 1993.
[Tic-Tac-Toe] [Evolutionary, Neural Network] [n]
- [178]
- David B. Fogel.
Evolving behaviors in the iterated prisoner's dilemma.
Evolutionary Computation, 1(1):77-97, 1993.
[Game Theory] [Evolutionary] [n]
- [179]
- David B. Fogel.
Evolving a checkers player without relying on human expertise.
Intelligence, 11(2):20-27, July 2000.
[Checkers] [Evolutionary, Neural Network] [n]
- [180]
- David B. Fogel.
Applying fogel and burgin's 'Competetive Goal-Seeking through Evolutionary
Programming' to coordination, trust, and bargaining games.
In Proceedings of the 2000 Congress on Evolutionary Computation,
pages 1210-1216, Piscataway, NJ, 2000. IEEE Press.
[Game Theory] [Evolutionary] [n]
- [181]
- David B. Fogel.
Blondie24: Playing at the Edge of AI.
Morgan Kaufmann Publishers, September 2001.
[Checkers] [Evolutionary, Neural Network] [n]
- [182]
- Michael Freed.
Learning strategic concepts from experience: A seven-stage process.
In Proceedings of the 13th Annual Conference of the Cognitive Science
Society, pages 132-136, Chicago, IL, 1991.
[Chess] [CBR] [y]
- [183]
- Michael Freed, Bruce Krulwich, Lawrence
Birnbaum, and Gregg Collins.
Reasoning about performance intentions.
In Proceedings of the 14th Annual Conference of the Cognitive Science
Society, pages 2-7. Lawrence Erlbaum, 1992.
[Chess] [CBR] [y]
- [184]
- B. Freisleben.
Teaching a neural network to play Go-Moku.
In I. Aleksander and J. Taylor, editors, Artificial Neural Networks
2, pages 1659-1662, Amsterdam, 1992. North-Holland.
[Go-Moku] [Neural Network] [y]
- [185]
- Yoav Freund and Robert E. Schapire.
A decision-theoretic generalization of on-line learning and an application to
boosting.
In Proceedings of the 2nd European Conference on Computational Learning
Theory (EuroCOLT-95), pages 23-37, 1995.
[Game Theory] [Ensembles] [y]
- [186]
- Yoav Freund and Robert E. Schapire.
Game
theory, on-line prediction and boosting.
In Proceedings of the 9th Annual Conference on Computational Learning
Theory (COLT-96), pages 325-332, 1996.
[Game Theory] [Multiplicative, Ensembles] [y]
- [187]
- Yoav Freund and Robert E. Schapire.
A
decision-theoretic generalization of on-line learning and an application to
boosting.
Journal of Computer and System Sciences, 55(1):119-139, 1997.
[Game Theory] [Ensembles] [y]
- [188]
- Yoav Freund and Robert E. Schapire.
Adaptive game playing using multiplicative weights.
Games and Economic Behavior, 29:79-103, 1999.
[Game Theory] [Multiplicative] [y]
- [189]
- Peter W. Frey.
An empirical technique for developing evaluation functions.
International Computer Chess Association Journal, 8(1):17-22,
1985.
[Chess] [Statistical] [n]
- [190]
- Peter W. Frey.
Algorithmic strategies for improving the performance of game playing programs.
Physica D, 22:355-365, 1986.
Also published in D. Farmer, A. Lapedes, N. Packard, and B. Wendroff (eds.)
Evolution, Games and Learning: Models for Adaptation in Machine and
Nature, North-Holland, 1986.
[Othello] [Statistical, CBR] [y]
- [191]
- Peter W. Frey.
Memory-based expertise: Computer chess vs. AI.
International Computer Chess Association Journal, 14(4):192-197,
1991.
[Chess] [CBR] [y]
- [192]
- Drew Fudenberg and David K. Levine.
The
Theory of Learning in Games.
Series on Economic Learning and Social Evolution. MIT Press, Cambridge, MA,
1998.
[Game Theory] [] [y]
- [193]
- Johannes Fürnkranz.
Machine
learning in computer chess: The next generation.
International Computer Chess Association Journal, 19(3):147-160,
September 1996.
[Chess] [] [y]
- [194]
- Johannes Fürnkranz.
Knowledge
discovery in chess databases: A research proposal.
Technical Report OEFAI-TR-97-33, Austrian Research Institute for Artificial
Intelligence, 1997.
[Chess] [Inductive] [y]
- [195]
- Johannes Fürnkranz and Miroslav
Kubat, editors.
Workshop Notes:
Machine Learning in Game Playing, Bled, Slovenia, 1999. 16th
International Conference on Machine Learning (ICML-99).
[] [] [y]
- [196]
- Johannes Fürnkranz, Bernhard
Pfahringer, Hermann Kaindl, and Stefan Kramer.
Learning
to use operational advice.
In W. Horn, editor, Proceedings of the 14th European Conference on
Artificial Intelligence (ECAI-00), pages 291-295, Berlin, 2000.
[Hearts] [Advice, TD] [y]
- [197]
- Johannes Fürnkranz and Miroslav
Kubat, editors.
Machines that Learn to Play Games.
Nova Science Publishers, Huntington, NY, 2001.
[] [] [y]
- [198]
- Johannes Fürnkranz.
Machine
learning in games: A survey.
In Fürnkranz and Kubat [197], chapter 2, pages 11-59.
[] [] [y]
- [199]
- Björn Gambäck and Manny
Rayner.
Contract Bridge as a micro-world for reasoning about communication agents.
Technical Report SICS/R-90/9011, Swedish Institute of Computer Science, 1990.
[Bridge] [Neural Network] [y]
- [200]
- Björn Gambäck, Manny Rayner,
and Barney Pell.
An architecture for a sophisticated mechanical Bridge player.
In D. N. Levy and D. F. Beal, editors, Heuristic Programming in
Artificial Intelligence 2 --- The Second Computer Olympiad,
Chichester, England, 1991. Ellis Horwood.
[Bridge] [Neural Network] [n]
- [201]
- Björn Gambäck, Manny Rayner,
and Barney Pell.
Pragmatic reasoning in
Bridge.
Technical Report 299, University of Cambridge, Computer Laboratory, April 1993.
[Bridge] [Neural Network] [y]
- [202]
- Michael Gherrity.
A Game-Learning
Machine.
PhD thesis, University of California, San Diego, CA, 1993.
[Tic-Tac-Toe, Connect-Four, Chess] [] [y]
- [203]
- J. Ignacio Giráldez and Daniel
Borrajo.
Distributed decision making in checkers.
In H. J. van den Herik and H. Iida, editors, Proceedings of the First
International Conference on Computers and Games (CG-98), volume 1558
of Lecture Notes in Computer Science, page 183, Tsukuba, Japan,
1998. Springer-Verlag.
[Checkers] [Collaborative] [n]
- [204]
- Fernand Gobet and Peter J. Jansen.
Towards a chess program based on a model of human memory.
In H. J. van den Herik, I. S. Herschberg, and J. W. H. M. Uiterwijk, editors,
Advances in Computer Chess 7, pages 35-60. University of
Limburg, 1994.
[Chess] [] [y]
- [205]
- Fernand Gobet and Herbert A. Simon.
Human learning in game playing.
In Fürnkranz and Kubat [197], chapter 3, pages 61-80.
[] [] [y]
- [206]
- J. Goodacre.
Inductive learning of chess rules using Progol.
Master's thesis, Programming Research Group, Oxford University Computing
Laboratory, Oxford, U.K., 1996.
[Chess] [ILP] [n]
- [207]
- Jeffrey Gould and Robert A. Levinson.
Method integration for experience-based learning.
Technical Report UCSC-CRL-91-27, Department of Computer and Information
Sciences, University of California, Santa Cruz, CA, August 1991.
[Chess] [Reinforcement] [y]
- [208]
- Jeffrey Gould and Robert A. Levinson.
Experience-based adaptive search.
In R. S. Michalski and G. Tecuci, editors, Machine Learning: A
Multi-Strategy Approach, pages 579-604. Morgan Kaufmann, 1994.
[Chess] [TD] [y]
- [209]
- Thore Graepel, Mike Goutrie, Marco
Krüger, and Ralf Herbrich.
Go, SVM, Go.
Unpublished Manuscript, 2000.
[Go] [SVM] [y]
- [210]
- Thore Graepel, Mike Goutrie, Marco
Krüger, and Ralf Herbrich.
Learning on
graphs in the game of Go.
In G. Dorffner, H. Bischof, and K. Hornik, editors, Proceedings of the
International Conference on Artificial Neural Networks (ICANN-01),
pages 347-352, Vienna, Austria, 2001. Springer-Verlag.
[Go] [SVM] [y]
- [211]
- Amy Greenwald.
Modern game
theory.
Technical Report TR 1998-757, New York University, 1998.
[Game Theory] [] [y]
- [212]
- Amy Greenwald.
Learning to
Play Network Games.
PhD thesis, New York University, May 1999.
[Game Theory] [] [y]
- [213]
- Kieran R. C. Greer.
Using a neural network as a search heuristic in computer chess.
Informatics Research Reports, 11:41-46, 1996.
Faculty of Informatics, University of Ulster.
[Chess] [Neural Network] [n]
- [214]
- Kieran R. C. Greer, Piyush C. Ojha, and
David A. Bell.
Learning search heuristics from examples: A study in computer chess.
In Proceedings of the 7th Conference of the Spanish Association for
Artificial Intelligence (CAEPIA-97), pages 695-704, 1997.
[Chess] [Neural Network] [n]
- [215]
- Kieran R. C. Greer.
A Neural Network Based Search Heuristic and its Application to Computer
Chess.
PhD thesis, University of Ulster, Jordanstown, Northern Ireland, 1998.
[Chess] [Neural Network] [n]
- [216]
- Kieran R. C. Greer, Piyush C. Ojha, and
David A. Bell.
A pattern-oriented approach to move ordering: the chessmaps heuristic.
International Computer Chess Association Journal, 22:13-21, 1999.
[Chess] [Neural Network] [y]
- [217]
- Arnold K. Griffith.
A new machine-learning technique applied to the game of checkers.
AI Memo 94, Massachusetts Institute of Technology (MIT), Cambridge,
Massachusetts, March 1966.
[Checkers] [] [n]
- [218]
- Arnold K. Griffith.
A comparison and evaluation of three machine learning procedures as applied to
the game of checkers.
Artificial Intelligence, 5:137-148, 1974.
[Checkers] [] [n]
- [219]
- Niall J. L. Griffith and Mark Lynch.
Neurodraughts: The
role of representation, search, training regime and architecture in a TD
draughts player.
In P. McKevitt, F. Murtagh, and J. Campbell, editors, Proceedings of the
8th Ireland Conference on Artificial Intelligence (AI-97),
Londonderry, Northern Ireland, 1997. University of Ulster.
[Checkers] [TD] [y]
- [220]
- Greg M. Gupton.
Genetic learning algorithm applied to the game of othello.
In D. N. Levy and D. F. Beal, editors, Heuristic Programming in
Artificial Intelligence --- The First Computer Olympiad, Chichester,
England, 1989. Ellis Horwood.
[Othello] [Evolutionary] [n]
- [221]
- C. Haider.
Anwendung von Verfahren des Maschinellen Lernens auf das japanische Brettspiel
Go.
Master's thesis, Technische Universität Berlin, 1988.
In German.
[Go] [] [n]
- [222]
- Ole Martin Halck and Fredrik A. Dahl.
On
classification of games and evaluation of players --- with some sweeping
generalizations about the literature.
In Fürnkranz and Kubat [195].
[] [] [y]
- [223]
- Ole Martin Halck and Fredrik A. Dahl.
Asymmetric co-evolution for imperfect-information zero-sum games.
In R. López de Mántaras and E. Plaza, editors, Proceedings of the
11th European Conference on Machine Learning (ECML-00), pages
171-182. Springer-Verlag, Barcelona, Spain, 2000.
[Game Theory] [Evolutionary] [y]
- [224]
- J. Hannan.
Approximation to Bayes risk in repeated plays.
In M. Dresher, A. W. Tucker, and P. Wolfe, editors, Contributions to the
Theory of Games 3, pages 97-139. Princeton University Press, 1957.
[Game Theory] [] [n]
- [225]
- Reuven A. Hasson, Shaul Markovitch, and
Yaron Sella.
Using filters to improve efficiency of game-playing learning procedures.
In Proceedings of the 11th International Conference of the Chilean
Computer Science Society, pages 125-137, Santiago, Chile, 1991.
[] [] [n]
- [226]
- Guy Haworth and M. Velliste.
Chess endgames and neural networks.
International Computer Chess Association Journal, 21(4):211-227,
December 1998.
[Chess] [Neural Network] [y]
- [227]
- A. Heeffer.
Automated acquisition of concepts for the description of middle-game positions
in chess.
Technical Report TIRM-84-005, The Turing Institute, Glasgow, 1984.
[Chess] [] [n]
- [228]
- Alois Heinz.
Efficient implementation of a neural net alpha-beta-evaluator.
Technical Report A-1993-2, Department of Computer Science, University of
Helsinki, Helsinki, Finland, 1993.
[] [Neural Network] [y]
- [229]
- Alois Heinz and Christoph Hense.
Bootstrap
learning of alpha-beta-evaluation functions.
In O. Abou-Rabia, C. K. Chang, and W. W. Koczkodaj, editors, Proceedings
of the Fifth International Conference on Computing and Information,
pages 365-369, Sudbury, Ontario, Canada, 1993. IEEE Computer Society Press.
[] [Neural Network] [y]
- [230]
- Alois Heinz.
Efficient neural net alpha-beta-evaluators.
In M. Marinaro and P. G. Morasso, editors, Proceedings of the
International Conference on Artificial Neural Networks, pages
635-638, Sorrento, Italy, 1994. Springer-Verlag.
[] [Neural Network] [y]
- [231]
- Christoph Hense.
Lernen von Klassifikationsbäumen für Spielsituationen.
Master's thesis, Institut für Informatik, Universität Freiburg,
Freiburg, Germany, June 1992.
In German.
[Malawi] [Inductive] [y]
- [232]
- H. Jaap van den Herik and I. S.
Herschberg.
Omniscience, the rulegiver?
In B. Pernici and M. Somalvico, editors, Proceedings of III Covegno
Internazionale L'Intelligenza Artificiale ed il Gioco Degli Scacchi,
pages 1-18, 1986.
[Chess] [Inductive] [y]
- [233]
- Marty Hirsch.
Machine learning in MChess Professional.
In H. J. van den Herik and B. Monien, editors, Advances in Computer
Games 9, pages 133-142. Universiteit Maastricht, Paderborn, Germany,
2001.
[Chess] [Rote Learning] [y]
- [234]
- Paul Hoffman.
MEL: A learning program that improves by experience in playing the game of
MILL.
Technical Report UIUCDCS-F-85-931, Department of Computer Science, University
of Illinois at Urbana-Champaign, Urbana-Champaign, IL, 1985.
[Mill] [] [n]
- [235]
- Feng-Hsiung Hsu, Thomas S. Anantharaman,
Murray S. Campbell, and Andreas Nowatzyk.
A
grandmaster chess machine.
Scientific American, 263(4):44-50, October 1990.
[Chess] [Statistical] [y]
- [236]
- Feng-Hsiung Hsu, Thomas S. Anantharaman,
Murray S. Campbell, and Andreas Nowatzyk.
Deep Thought.
In T. A. Marsland and J. Schaeffer, editors, Computers, Chess, and
Cognition, chapter 5, pages 55-78. Springer-Verlag, 1990.
[Chess] [Statistical] [y]
- [237]
- Jia-Miene Hsu.
A strategic game program that learns from mistakes.
Master's thesis, Northwestern University, Evanston, IL, 1985.
[Othello] [CBR] [n]
- [238]
- Robert M. Hyatt.
Book learning --- a methodology to tune an opening book automatically.
International Computer Chess Association Journal, 22(1):3-12,
March 1999.
[Chess] [Reinforcement, TD, Collaborative] [y]
- [239]
- Nobuhiro Inuzuka, Hayato Fujimoto,
Tomofumi Nakano, and Hidenori Itoh.
Pruning nodes in the alpha-beta method using inductive logic programming.
In Fürnkranz and Kubat [195].
[Othello] [ILP] [y]
- [240]
- Jean-Francois Isabelle.
Auto-apprentissage à l'aide de résaux de neurones, de fonctions
heuristiques utilisées dans les jeux stratégiques.
Master's thesis, University of Montreal, 1993.
In French.
[Othello] [Reinforcement, TD] [y]
- [241]
- Charles L. Isbell.
Explorations of the practical issues of learning prediction-control tasks
using temporal difference learning methods.
Master's thesis, Department of Electrical Engineering and Computer Science,
Massachusetts Institute of Technology, Evanston, IL, December 1992.
[Tic-Tac-Toe] [TD] [n]
- [242]
- Jeffrey Alan Jackson.
Economics of automatic generation of rules from examples in a chess end-game.
Technical Report UIUCDCS-F-85-932, University of Illinois at Urbana-Champaign,
Department of Computer Science, Urbana, IL, 1985.
[Chess] [] [n]
- [243]
- Amir Jafari, Amy Greenwald, David
Gondek, and Gunes Ercal.
On no-regret
learning, fictitious play, and Nash equilibrium.
In C. E. Brodley and A. P. Danyluk, editors, Proceedings of the 18th
International Conference on Machine Learning (ICML-01), pages
226-233, Williamstown, MA, 2001. Morgan Kaufmann.
[Game Theory] [] [y]
- [244]
- Dimitrios Kalles and Panagiotis
Kanellopoulos.
On verifying game
designs and playing strategies using reinforcement learning.
In Proceedings of the 2001 ACM Symposium on Applied Computing
(SAC-01), pages 6-11, Las Vegas, March 2001.
[] [Reinforcement, Neural Network] [y]
- [245]
- K. Kayama and H. Inoue.
Learning for forward pruning in Shogi.
In H. Matsubara, editor, Proceedings of the 3rd Game Programming
Workshop, Hakone, Japan, 1996.
In Japanese.
[Shogi] [Evolutionary] [n]
- [246]
- W. T. Katz and S. P. Pham.
Experience-based learning experiments using go-moku.
In Proceedings of the 1991 IEEE International Conference on Systems,
Man, and Cybernetics, pages 1405-1410, 1991.
[Go-Moku] [Neural-Network] [n]
- [247]
- Graham Kendall and Mark Willdig.
An investigation
of an adaptive Poker player.
In Proceedings of the 14th Australian Joint Conference on Artificial
Intelligence (AI-01), pages 189-200, Adelaide, Australia, 2001.
Springer-Verlag.
[Poker] [Evolutionary] [y]
- [248]
- Graham Kendall and Glenn Whitwell.
An
evolutionary approach for the tuning of a chess evaluation function using
population dynamics.
In Proceedings of the 3rd Congress on Evolutionary Computation
(CEC-01), pages 995-1002, Seoul, Korea, 2001. IEEE Press.
[Chess] [Evolutionary] [y]
- [249]
- Graham Kendall.
An investigation of an adaptive cribbage player.
In J. Schaeffer, M. Müller, and Y. Björnsson, editors, Computers
and Games: Proceedings of the 3rd International Conference (CG-02),
volume 2883 of Lecture Notes in Computer Science, Edmonton,
Canada, 2002. Springer-Verlag.
[Chess] [Evolutionary] [y]
- [250]
- Yaakov Kerner.
Case-based evaluation in computer chess.
In M. Keane, J. P. Haton, and M. Manago, editors, Topics in Case-Based
Reasoning (EWCBR-94), Lecture Notes in Artificial Intelligence,
Berlin, 1994. Springer-Verlag.
[Chess] [CBR] [y]
- [251]
- Yaakov Kerner.
Learning strategies for explanation patterns: Basic game patterns with
application to chess.
In M. Veloso and A. Aamodt, editors, Proceedings of the 1st International
Conference on Case-Based Reasoning (ICCBR-95), volume 1010 of
Lecture Notes in Artificial Intelligence, pages 491-500,
Berlin, 1995. Springer-Verlag.
[Chess] [CBR] [y]
- [252]
- Levente Kocsis, Jos W. H. M. Uiterwijk,
and H. Jaap van den Herik.
Learning time allocation using neural networks.
In T. A. Marsland and I. Frank, editors, Computers and Games: Proceedings
of the 2nd International Conference (CG-01), volume 2063 of
Lecture Notes in Computer Science, pages 170-185, Hamamatsu,
Japan, 2001. Springer-Verlag.
[Chess] [TD, Neural Network] [n]
- [253]
- Levente Kocsis and Jos W. H. M.
Uiterwijk.
Learning move ordering in chess.
In Jos W. H. M. Uiterwijk, editor, Proceedings of the 6th Computer
Olympiad Computer-Games Workshop, Maastricht, NL, August 2001. IKAT,
Department of Computer Science, Universiteit Maastricht.
Technical Report CS 01-04.
[Chess] [] [n]
- [254]
- Monika Köhle and Franz
Schönbauer.
Erfahrung mit einem Neuralen Netz, das Bridge spielen lernt.
In J. Retti and K. Leidlmair, editors, Proceedings of the 5th Austrian
Meeting on Artificial Intelligence, pages 224-229, Berlin, 1989.
Springer-Verlag.
[Bridge] [Neural Network] [y]
- [255]
- Takuya Kojima, Kazuhiro Ueda, and
Saburo Nagano.
A case study on acquisition and refinement of deductive rules based on EBG in
an adversary game: How to capture stones in Go.
In Proceedings of the 1st Game Programming Workshop, pages 34-43,
Japan, 1994.
[Go] [EBL] [n]
- [256]
- Takuya Kojima.
A
model of acquisition and refinement of deductive rules in the game of
Go.
Master's thesis, University of Tokyo, 1995.
In Japanese.
[Go] [EBL] [y]
- [257]
- Takuya Kojima, Kazuhiro Ueda, and
Saburo Nagano.
A
case study on acquisition of pattern knowledge in Go using ecological
analogy.
In H. Matsubara, editor, Proceedings of the 3rd Game Programming
Workshop, Hakone, Japan, 1996.
[Go] [Evolutionary] [y]
- [258]
- Takuya Kojima, Kazuhiro Ueda, and
Saburo Nagano.
Flexible acquisition of various types of knowledge from game records:
Application to the game of Go.
In H. Iida, J. Schaeffer, J. W. H. M. Uiterwijk, and Y. Saito, editors,
Proceedings of the IJCAI-97 Workshop on Using Games as an Experimental
Testbed for AI Research, pages 51-57, Nagoya, Japan, 1997.
[Go] [Evolutionary] [y]
- [259]
- Takuya Kojima, Kazuhiro Ueda, and
Saburo Nagano.
An evolutionary algorithm extended by ecological analogy and its application to
the game of Go.
In Proceedings of the 15th International Joint Conference on Artificial
Intelligence (IJCAI-97), pages 684-689, Nagoya, Japan, 1997.
[Go] [Evolutionary] [y]
- [260]
- Takuya Kojima, Kazuhiro Ueda, and
Saburo Nagano.
Acquisition of patterms, sequences of moves, and Tsume-Go knowledge from game
records.
In H. Matsubara, editor, Proceedings of the 4th Game Programming
Workshop, Tokyo, Japan, 1997. Computer Shogi Association.
In Japanese.
[Go] [Evolutionary] [y]
- [261]
- Takuya Kojima.
Automatic Acquisition of Go Knowledge from Game Records: Deductive and
Evolutionary Approaches.
PhD thesis, University of Tokyo, 1998.
[Go] [Evolutionary] [y]
- [262]
- Takuya Kojima and Atsushi Yoshikawa.
Knowledge acquisition from game records.
In Fürnkranz and Kubat [195].
[Go] [Evolutionary] [y]
- [263]
- Takuya Kojima and Atsushi Yoshikawa.
A two-step model of pattern acquisition: Application to tsume-go.
In H. J. van den Herik and H. Iida, editors, Computers and Games:
Proceedings of the 1st International Conference (CG-98), volume 1558
of Lecture Notes in Computer Science, pages 146-166, Tsukuba,
Japan, 1999. Springer-Verlag.
[Go] [] [n]
- [264]
- Takuya Kojima, Kazuhiro Ueda, and
Saburo Nagano.
Flexible acquisition of various types of Go knowledge.
In H. J. van den Herik and H. Iida, editors, Games in AI Research,
pages 221-238. Universiteit Maastricht, 2000.
[Go] [Evolutionary] [y]
- [265]
- Takuya Kojima and Atsushi Yoshikawa.
Acquisition of go knowledge from game records.
In Fürnkranz and Kubat [197], chapter 9, pages 179-204.
[Go] [Evolutionary, EBL] [y]
- [266]
- J. F. Kolen and A. K. Goel.
Learning in parallel distributed processing networks: Computational complexity
and information content.
IEEE Transactions on Systems, Man, and Cybernetics,
21(2):359-367, 1991.
[Tic-Tac-Toe] [Neural Network] [n]
- [267]
- E. Koffman.
Learning through pattern recognition applied to a class of games.
IEEE Transactions on Systems Sciences and Cybernetics, 4(1), 1968.
[] [] [n]
- [268]
- J. Korst.
Het genereren van regels voor schaak eindspelen ofwel: Eindspelen, moeilijker
dan je denkt!
Master's thesis, Delft University of Technology, Department of Mathematics and
Computer Science, Delft, The Netherlands, 1984.
[Chess] [] [n]
- [269]
- Bruce Krulwich.
Learning from deliberated reactivity.
In L. Birnbaum and G. Collins, editors, Proceedings of the 8th
International Workshop on Machine Learning (ML-91), pages 318-322.
Morgan Kaufmann, 1991.
[Chess] [CBR] [y]
- [270]
- Bruce Krulwich.
Determining what to learn in a multi-component planning system.
In Proceedings of the 13th Annual Conference of the Cognitive Science
Society, pages 102-107, Chicago, IL, 1991.
[Chess] [CBR] [y]
- [271]
- Bruce Krulwich, Lawrence Birnbaum,
and Gregg Collins.
Learning several lessons from one experience.
In Proceedings of the 14th Annual Conference of the Cognitive Science
Society, pages 242-247. Lawrence Erlbaum, 1992.
[Chess] [CBR] [n]
- [272]
- Bruce Krulwich.
Planning for soft goals.
In Proceedings of the Conference on AI Planning Systems, 1992.
[Chess] [CBR] [n]
- [273]
- Bruce Krulwich.
Flexible Learning in a Multi-Component Planning System.
PhD thesis, The Institute for the Learning Sciences, Northwestern University,
Evanston, IL, 1993.
Technical Report #46.
[Chess] [CBR] [n]
- [274]
- Bruce Krulwich, Larry Birnbaum, and
Gregg Collins.
Determining what to learn through component-task modeling.
In Proceedings of the 14th International Joint Conference on Artificial
Intelligence (IJCAI-95), pages 439-445, 1995.
[Chess] [CBR] [y]
- [275]
- Miroslav Kubat.
Should machines learn how to play games?
In Fürnkranz and Kubat [197], chapter 1, pages 1-10.
[] [] [y]
- [276]
- Miroslav Kubat and Jan v Zi v zka.
Learning middle-game patterns in chess: a case study.
In Proceedings of the 13th International Conference on Industrial and
Engineering Applications of Artificial Intelligence and Expert Systems
(IEA/AIE-2000), pages 426-433, New Orleans, 2001. Springer-Verlag.
[Chess] [Inductive] [y]
- [277]
- Dorothee Kümmerlin.
Genetische Algorithmen zur Bestimmung heuristischer
Bewertungsfunktionen bei Spielen.
Master's thesis, Institut für Informatik, Universität Freiburg,
Freiburg, Germany, May 1992.
In German.
[Othello] [Evolutionary] [y]
- [278]
- Leonid Kuvayev.
Learning to play Hearts.
In Proceedings of the 14th National Conference on Artificial Intelligence
(AAAI-97), page 837, Providence, RI, 1997. AAAI Press.
Extended Abstract.
[Hearts] [Neural Network, TD] [y]
- [279]
- Leonid Kuvayev.
Learning
to play Hearts.
Extended Version of [278], 1997.
[Hearts] [Neural Network, TD] [y]
- [280]
- Kai-Fu Lee and Sanjoy Mahajan.
A pattern classification apporach to evaluation function learning.
Artificial Intelligence, 36:1-25, 1988.
[Othello] [Statistical] [y]
- [281]
- Kai-Fu Lee and Sanjoy Mahajan.
The development of a world class Othello program.
Artificial Intelligence, 43:21-36, 1990.
[Othello] [Statistical] [y]
- [282]
- Marc Leineweber.
Lernen von Bewertungsfunktionen mittels Adaptiver Logischer
Netzwerke.
Master's thesis, Institut für Informatik, Universität Freiburg,
Freiburg, Germany, April 1994.
In German.
[Mill] [Neural Network] [y]
- [283]
- Anton Leouski.
Learning of position evaluation in the game of othello.
Technical Report UM-CS-1995-023, Computer Science Department, Lederle Graduate
Research Center, University of Massachusetts, Amherst, MA, March 1995.
[Othello] [TD, Neural Network] [y]
- [284]
- Anton Leouski and Paul E. Utgoff.
What a neural network can learn about Othello.
Technical Report UM-CS-1996-010, Computer Science Department, Lederle Graduate
Research Center, University of Massachusetts, Amherst, MA, March 1996.
[Othello] [TD, Neural Network] [y]
- [285]
- Robert A. Levinson.
A self-learning, pattern-oriented chess program.
International Computer Chess Association Journal, 12(4):207-215,
1989.
[Chess] [Reinforcement] [n]
- [286]
- Robert A. Levinson and R. Snyder.
Adaptive pattern-oriented chess.
In L. Birnbaum and G. Collins, editors, Proceedings of the 8th
International Workshop on Machine Learning (ML-91), pages 85-89.
Morgan Kaufmann, 1991.
[Chess] [Reinforcement] [y]
- [287]
- Robert A. Levinson and R. Snyder.
Adaptive pattern-oriented chess.
In Proceedings of the 9th National Conference on Artificial Intelligence
(AAAI-91), pages 601-606. Morgan Kaufmann, 1991.
[Chess] [Reinforcement] [y]
- [288]
- Robert A. Levinson.
A self-organizing pattern retrieval system and its applications.
International Journal of Intelligent Systems, 6:717-738, 1991.
[Chess] [Reinforcement] [n]
- [289]
- Robert A. Levinson, B. Beach,
R. Snyder, T. Dayan, and K. Sohn.
Adaptive-predictive game-playing programs.
Journal of Experimental and Theoretical Artificial Intelligence,
4(4), 1992.
[] [Reinforcement] [y]
- [290]
- Robert A. Levinson and J. Amenta.
Morph: an experience-based adaptive chess system.
International Computer Chess Association Journal, 16(1):51-53,
1993.
[Chess] [Reinforcement] [y]
- [291]
- Robert A. Levinson.
Exploiting the physics of state-space search.
Technical Report UCSC-CRL-94-32, Department of Computer and Information
Sciences, University of California, Santa Cruz, CA, 1994.
[Chess] [Reinforcement] [y]
- [292]
- Robert A. Levinson.
Experience-based creativity.
In T. Dartnall, editor, Artificial Intelligence and Creativity: An
Interdisciplinary Approach, pages 161-179. Kluwer Academic Press,
Boston, MA, 1994.
[Chess] [Reinforcement] [y]
- [293]
- Robert A. Levinson.
General
game-playing and reinforcement learning.
Computational Intelligence, 12(1):155-176, 1996.
Special Issue on Games: Structure and Learning.
[Chess] [Reinforcement] [y]
- [294]
- Robert A. Levinson and Ryan J. Weber.
Chess neighborhoods, function combination, and reinforcement learning.
In T. A. Marsland and I. Frank, editors, Computers and Games: Proceedings
of the 2nd International Conference (CG-01), volume 2063 of
Lecture Notes in Computer Science, pages 133-150, Hamamatsu,
Japan, 2001. Springer-Verlag.
[Chess] [TD, Neural Network] [n]
- [295]
- Thomas R. Lincke.
Strategies for the automatic construction of opening
books.
In T. Marsland and I. Frank, editors, Computers and Games: Proceedings of
the 2nd International Conference (CG-01), volume 2063 of Lecture
Notes in Computer Science, pages 74-86, Hamamatsu, Japan, 2001.
Springer-Verlag.
[Awari, Othello] [] [n]
- [296]
- Michael L. Littman.
Markov games as
a framework for multi-agent reinforcement learning.
In Proceedings of the 11th International Conference on Machine Learning
(ML-94), pages 157-163, New Brunswick, NJ, 1994. Morgan Kaufmann.
[Grid Soccer, Game Theory] [Reinforcement] [y]
- [297]
- Michael L. Littman and Gaba
Szepesvári.
A generalized
reinforcement-learning model: Convergence and applications.
In L. Saitta, editor, Proceedings of the 13th International Conference on
Machine Learning (ICML-96), pages 310-318, Bari, Italy, 1996. Morgan
Kaufmann.
[] [Reinforcement] [y]
- [298]
- Michael L. Littman.
Value-function reinforcement learning in Markov games.
Journal of Cognitive Systems Research, 2:55-66, 2001.
[] [Reinforcement] [y]
- [299]
- Michael L. Littman.
Friend-or-fow
Q-learning in general-sum games.
In C. E. Brodley and A. P. Danyluk, editors, Proceedings of the 18th
International Conference on Machine Learning (ICML-01), pages
322-328, Williamstown, MA, 2001. Morgan Kaufmann.
[Game Theory] [Reinforcement] [y]
- [300]
- David H. Lorenz and Shaul Markovitch.
Derivative evaluation function learning using genetic operators.
In Epstein and Levinson [140],
pages 106-114.
[Checkers] [Evolutionary] [y]
- [301]
- David H. Lorenz.
Learning in games using symbolic classification: Derivative genetic operators
for evaluation function learning.
Master's thesis, Technion -- Israel Institute of Technology, Haifa, Israel, May
1993.
[Checkers] [Evolutionary] [n]
- [302]
- Alex Lubberts and Risto Miikkulainen.
Co-evolving a Go-playing neural network.
In Proceedings of the GECCO-01 Workshop on Coevolution: Turning Adaptive
Algorithms upon Themselves, pages 14-19, 2001.
[Go] [Evolutionary, Neural Network] [y]
- [303]
- Mark Lynch.
Neurodraughts: An application of
temporal difference learning to Draughts.
Final Year Project Report, Department of Computer Science and Information
Systems, University of Limerick, Ireland, June 1997.
[Checkers] [TD] [y]
- [304]
- Shaul Markovitch and Yaron Sella.
Learning
of resource allocation strategies for game playing.
In R. Bajcsy, editor, Proceedings of the 13th International Joint
Conference on Artificial Intelligence (IJCAI-93), pages 974-979,
1993.
[Checkers] [] [y]
- [305]
- Christopher John Matheus.
Adding domain knowledge to SBL through feature construction.
In Proceedings of the 8th National Conference on Artificial Intelligence
(AAAI-90), pages 803-808, 1990.
[Tic-Tac-Toe] [Inductive] [y]
- [306]
- Shaul Markovitch and Yaron Sella.
Learning
of resource allocation strategies for game playing.
Computational Intelligence, 12(1):88-105, 1996.
[Checkers] [] [y]
- [307]
- T. Anthony Marsland.
Evaluation-function factors.
International Computer Chess Association Journal, 8(2):47-57,
1985.
[Chess] [Statistical] [y]
- [308]
- H. H. Martens.
Two notes on machine `learning'.
Information and Control, 2:364-379, 1959.
[Chess] [Rote Learning] [n]
- [309]
- Christopher C. McConnell.
Tuning evaluation functions for search.
In Proceedings of the Hong Kong Computer Strategy Game Programming
Workshop, 1995.
Extended Abstract.
[Chess] [Statistical] [y]
- [310]
- Alex B. Meijer and Henk Koppelaar.
A learning architecture for the game of Go.
In Proceedings of the 2nd Annual European Conference on Simulation and AI
in Computer Games (GAME-ON-01), London, 2001.
[Go] [] [y]
- [311]
- H. J. Messerschmidt.
Machine learning and chess.
In M. A. Bramer, editor, Computer Game-Playing: Theory and
Practice, chapter 4, pages 53-62. Ellis Horwood, Chichester, England,
1983.
[Chess] [Inductive] [y]
- [312]
- Maarten van der Meulen.
Weight assessment in evaluation functions.
In D. F. Beal, editor, Advances in Computer Chess 5, pages 81-89.
Elsevier, Amsterdam, 1989.
[Chess] [Statistical] [y]
- [313]
- Ryszard S. Michalski and P. Negri.
An experiment on inductive learning in chess end games.
In E. W. Elcock and D. Michie, editors, Machine Intelligence 8,
pages 175-192. Ellis Horwood, Chichester, U.K., 1977.
[Chess] [Inductive] [n]
- [314]
- Donald Michie.
Trial and error.
In S. A. Barnett and A. McLaren, editors, Science Survey, Part 2,
pages 129-145. Penguin, Harmondsworth, U.K., 1961.
Reprinted in [320].
[Tic-Tac-Toe] [Reinforcement] [n]
- [315]
- Donald Michie.
Puzzle-learning versus game-learning in studies of behaviour.
In I. J. Good, editor, The Scientist Speculates, pages 90-100.
Heinemann, 1962.
Reprinted in [320].
[Tic-Tac-Toe] [Reinforcement] [n]
- [316]
- Donald Michie.
Experiments on the mechanization of game-learning -- Part I. Characterization
of the model and its parameters.
The Computer Journal, 6:232-236, 1963.
[Tic-Tac-Toe] [Reinforcement] [y]
- [317]
- Donald Michie.
Game-playing and game-learning automata.
In L. Fox, editor, Advances in Programming and Non-Numerical
Computation, pages 183-200. Pergamon Press, New York, 1966.
[] [] [n]
- [318]
- Donald Michie.
Experiments on the mechanization of game-learning 2 -- rule-based learning and
the human window.
The Computer Journal, 25(1):105-113, 1982.
[Chess] [Inductive] [y]
- [319]
- Donald Michie and R. A. Chambers.
BOXES: An experiment in adaptive control.
In E. Dale and D. Michie, editors, Machine Intelligence 2, pages
137-152. Oliver and Boyd, Edinburgh, 1968.
[Tic-Tac-Toe] [Reinforcement] [n]
- [320]
- Donald Michie.
On Machine Intelligence.
Ellis Horwood Limited, Chichester, UK, 2nd edition edition, 1986.
[] [] [n]
- [321]
- Steve Minton.
Constraint based generalization: Learning game playing plans from single
examples.
In Proceedings of the 2nd National Conference on Artificial Intelligence
(AAAI-84), pages 251-254, Austin, TX, 1984.
[Chess, Go-Moku, Tic-Tac-Toe] [EBL] [y]
- [322]
- Steve Minton.
A game-playing program that learns by analyzing examples.
Technical Report CMU-CS-85-130, Carnegie-Mellon University. Department of
Computer Science, 1985.
[] [EBL] [n]
- [323]
- Donald H. Mitchell.
Using features to evaluate positions in experts' and novices' Othello games.
Master's thesis, Northwestern University, Evanston, IL, 1984.
[Othello] [Statistical] [n]
- [324]
- Dov Monderer and Moshe Tennenholtz.
Dynamic
non-bayesian decision making.
Journal of Artificial Intelligence Research, 7:231-248, 1997.
[Game Theory] [] [y]
- [325]
- Eduardo Morales.
Learning features by experimentation in chess.
In Y. Kodratoff, editor, Proceedings of the 5th European Working Session
on Learning (EWSL-91), pages 494-511. Springer Verlag, 1991.
[Chess] [ILP] [y]
- [326]
- Eduardo Morales.
Learning chess patterns.
In S. H. Muggleton, editor, Inductive Logic Programming, number 38
in The A.P.I.C. Series, chapter 26, pages 517-537. Academic Press, 1992.
[Chess] [ILP] [y]
- [327]
- Eduardo Morales.
First-Order Induction of Patterns in Chess.
PhD thesis, The Turing Institute -- University of Strathclyde, Strathclyde,
U.K., 1992.
[Chess] [ILP] [n]
- [328]
- Eduardo Morales.
Learning patterns for playing KRK.
In C. Rouveirol, editor, ECAI-92 Workshop Notes on Logical Approaches to
Machine Learning, Vienna, Austria, 1992.
[Chess] [ILP] [y]
- [329]
- Eduardo Morales.
Learning patterns
for playing strategies.
International Computer Chess Association Journal, 17(1):15-26,
1994.
[Chess] [ILP] [y]
- [330]
- Eduardo Morales.
Learning playing
strategies in chess.
Computational Intelligence, 12(1):65-87, 1996.
[Chess] [ILP] [y]
- [331]
- Eduardo Morales.
PAL: A
pattern-based first-order inductive system.
Machine Learning, 26(2-3):227-252, 1997.
Special Issue on Inductive Logic Programming.
[Chess] [ILP] [y]
- [332]
- Eduardo Morales.
On learning how to
play.
In H. J. van den Herik and J. W. H. M. Uiterwijk, editors, Advances in
Computer Chess 8, pages 235-250. Universiteit Maastricht, 1997.
[Chess] [ILP] [y]
- [333]
- David Moriarty and Risto
Miikkulainen.
Evolving complex othello strategies using marker-based genetic encoding of
neural networks.
Technical Report AI93-206, Department of Computer Sciences, University of
Texas, Austin, TX, 1993.
[Othello] [Evolutionary, Neural Network] [y]
- [334]
- David Moriarty and Risto
Miikkulainen.
Evolving neural networks to focus minimax search.
In Proceedings of 12th National Conference on Artificial Intelligence
(AAAI-94), pages 1371-1377, 1994.
[Othello] [Evolutionary, Neural Network] [y]
- [335]
- David Moriarty and Risto
Miikkulainen.
Discovering complex othello strategies through evolutionary neural
networks.
Connection Science, 7(3-4):195-209, 1995.
[Othello] [Evolutionary, Neural Network] [y]
- [336]
- David Moriarty and Risto
Miikkulainen.
Learning sequential decision tasks.
Technical Report AI95-229, Department of Computer Sciences, University of
Texas, Austin, TX, 1995.
[Othello] [Evolutionary, Neural Network] [y]
- [337]
- David Jack Mostow.
Mechanical Transformation of Task Heuristics into Operational
Procedures.
PhD thesis, Carnegie Mellon University, Department of Computer Science, 1981.
[Hearts] [Advice] [y]
- [338]
- David Jack Mostow.
Machine transformation of advice into a heuristic search procedure.
In Machine Learning: An Artificial Intelligence Approach, pages
367-403. Morgan Kaufmann, 1983.
[Hearts] [Advice] [y]
- [339]
- Stephen H. Muggleton.
Inductive acquisition of chess strategies.
In J. E. Hayes, D. Michie, and J. Richards, editors, Machine Intelligence
11, chapter 17, pages 375-387. Clarendon Press, 1988.
[Chess] [Inductive] [y]
- [340]
- Stephen H. Muggleton.
Inductive Acquisition of Expert Knowledge.
Turing Institute Press. Addison-Wesley, 1990.
[Chess] [Inductive] [y]
- [341]
- A. Murray and E. Elcock.
Automatic description and recognition of board patterns in go-moku.
In E. Dale and D. Michie, editors, Machine Intelligence 2.
Elsevier, 1968.
[Go-Moku] [] [n]
- [342]
- Peter Mysliwietz.
Konstruktion und Optimierung von Bewertungsfunktionen beim
Schach.
PhD thesis, University of Paderborn, Germany, 1994.
In German.
[Chess] [] [y]
- [343]
- Hirofumi Nakaie, Hiroyuki Iida, and
Yoshiyuki Kotani.
A method of applying opening book data on non-recorded positions.
In H. Matsubara, editor, Proceedings of the 3rd Game Programming
Workshop, Hakone, Japan, 1996.
In Japanese.
[Shogi] [CBR] [n]
- [344]
- Hirofumi Nakaie and Yoshiyuki Kotani.
A method of applying opening book data by partial matching.
In H. Matsubara, editor, Proceedings of the 4th Game Programming
Workshop, Tokyo, Japan, 1997. Computer Shogi Association.
In Japanese.
[Shogi] [CBR] [n]
- [345]
- Teigo Nakamura.
Acquisition of move sequence patterns from game record database using n-gram
statisctics.
In H. Matsubara, editor, Proceedings of the 4th Game Programming
Workshop, Tokyo, Japan, 1997. Computer Shogi Association.
In Japanese.
[Shogi] [Statistical] [n]
- [346]
- Tomofumi Nakano, Nobuhiro Inuzuka,
Hirohisa Seki, and Hidenori Itoh.
Inducing Shogi heuristics using inductive logic programming.
In D. Page, editor, Proceedings of the 8th International Conference on
Inductive Logic Programming (ILP-98), pages 155-164, Madison, WI,
1998. Springer.
[Chess] [ILP] [y]
- [347]
- P. Negri.
Inductive learning in a hierarchical model of representing knowledge in chess
end games.
In E. W. Elcock and D. Michie, editors, Machine Intelligence 8,
pages 193-204. Ellis Horwood, Chichester, 1977.
[Chess] [Inductive] [n]
- [348]
- C. Newman and L. Uhr.
BOGART: A discovery and induction program for games.
In ACM 20th National Conference, pages 176--, 1965.
[] [] [n]
- [349]
- T. Nitsche.
A learning chess program.
In M. R. B. Clarke, editor, Advances in Computer Chess 3, pages
113-120. Pergamon Press, 1982.
[Chess] [Statistical] [y]
- [350]
- Jason Noble and R. A. Watson.
Pareto co-evolution: Using performance against coevolved opponents in a game as
dimensions for pareto selection.
In L. Spector, E. Goodman, A. Wu, W.B. Langdon, H.-M. Voigt, M. Gen, S. Sen,
M. Dorigo, S. Pezeshk, M. Garzon, and E. Burke, editors, Proceedings of
the Genetic and Evolutionary Computation Conference (GECCO-01), pages
493-500, 2001.
[Poker] [Evolutionary] [y]
- [351]
- Jason Noble.
Finding robust Texas Hold'em poker strategies using pareto coevolution and
deterministic crowding.
In Proceedings of the 2002 International Conference on Machine Learning
and Applications (ICMLA-02), CSREA Press, 2002.
[Poker] [Evolutionary] [y]
- [352]
- Daniel Kenneth Olson.
Learning to play
games from experience: An application of artificial neural networks and
temporal difference learning.
Master's thesis, Pacific Lutheran University, Washington, 1993.
[BlackJack, Tic-Tac-Toe] [Neural Network, TD] [y]
- [353]
- P. O'Rorke.
A comparative study of inductive learning systems AQ11P and ID3 using a
chess end-game test problem.
ISG 82-2, Computer Science Department, Univ. of Illinois at Urbana-Champaign,
1982.
[Chess] [Inductive] [n]
- [354]
- Jim Painter.
Pattern recognition for decisoin making in a competitive environment.
Master's thesis, Hunter College of the City University of New York, New York,
NY, 1993.
[Tic-Tac-Toe] [] [n]
- [355]
- A. Paterson.
An attempt to use CLUSTER to synthesise humanly intelligible subproblems for
the KPK chess endgame.
Technical Report UIUCDCS-R-83-1156, University of Illinois, Urbana, IL, 1983.
[Chess] [Inductive] [n]
- [356]
- Barney Pell.
Exploratory
learning in the game of go.
In D. N. Levy and D. F. Beal, editors, Heuristic Programming in
Artificial Intelligence 2 --- The Second Computer Olympiad,
Chichester, England, 1991. Ellis Horwood.
[Go] [] [y]
- [357]
- Barney Pell.
A computer game-learning tournament.
In Proceedings of the Swedish Artificial Intelligence Symposium,
1993.
[] [] [n]
- [358]
- Bernhard Pfahringer, Hermman
Kaindl, Stefan Kramer, and Johannes Fürnkranz.
Learning to make good use of operational advice.
In Fürnkranz and Kubat [195].
[Hearts] [Advice, TD] [y]
- [359]
- Jacques Pitrat.
A program to learn to play chess.
In Chen, editor, Pattern Recognition and Artificial Intelligence,
pages 399-419. Academic Press, New York, 1976.
[Chess] [EBL] [y]
- [360]
- Jacques Pitrat.
Realization of a program learning to find combinations at chess.
In J. C. Simon, editor, Computer Oriented Learning Processes,
volume 14 of NATO Advanced Study Institute Series, Series E: Appied
Science. Noordhoff, Leyden, 1976.
[Chess] [EBL] [y]
- [361]
- Jacques Pitrat.
A chess combination program which uses plans.
Artificial Intelligence, 8:275-321, 1977.
[Chess] [EBL] [y]
- [362]
- Jordan B. Pollack, Alan D. Blair, and
Mark Land.
Coevolution of a
backgammon player.
In C. G. Langton, editor, Proceedings of Artificial Life V,
Cambridge, MA, 1996. MIT Press.
[Backgammon] [Evolutionary] [y]
- [363]
- Jordan B. Pollack and Alan D. Blair.
Why did TD-Gammon
work?.
In Advances in Neural Information Processing Systems 9, Cambridge,
MA, 1996. MIT Press.
[Backgammon] [Evolutionary] [y]
- [364]
- Jordan B. Pollack and Alan D. Blair.
Co-evolution in
the successful learning of backgammon strategy.
Machine Learning, 32(1):225-240, 1998.
[Backgammon] [Evolutionary, Neural Network] [y]
- [365]
- Pierre Pompidor.
Learning by examples and counter-examples using euclidean geometry --- applied
to the game of go.
In Proceedings of the First Cannes/Sophia-Antipolis Go Research
Day, February 1992.
[Go] [Inductive] [y]
- [366]
- C. Posthoff, Michael Schlosser,
R. Staudte, and J. Zeidler.
Transformations of knowledge.
In H. J. van den Herik, I. S. Herschberg, and J. W. H. M. Uiterwijk, editors,
Advances in Computer Chess 7, pages 177-202. University of
Limburg, 1994.
[Chess] [] [y]
- [367]
- Jean-Francois Puget.
Goal regression with opponent.
In Progress in Machine Learning, pages 121-137. Sigma Press,
1987.
[Go-Moku] [] [y]
- [368]
- Dehu Qi and Ron Sun.
GA-based multi-agent reinforcement learning for playing backgammon.
In Proceedings of the Genetic and Evolutionary Computation
Conference, pages 777-778, 2001.
[Backgammon] [Evolutionary] [n]
- [369]
- J. Ross Quinlan.
Discovering rules by induction from large collections of examples.
In D. Michie, editor, Expert Systems in the Micro Electronic Age,
pages 168-201. Edinburgh University Press, 1979.
[Chess] [Inductive] [y]
- [370]
- J. Ross Quinlan.
Learning efficient classification procedures and their application to chess end
games.
In R. S. Michalski, J. G. Carbonell, and T. M. Mitchell, editors, Machine
Learning: An Artificial Intelligence Approach, pages 463-482. Tioga,
Palo Alto, 1983.
[Chess] [Inductive] [y]
- [371]
- Jan Ramon, Tom Francis, and Hendrik
Blockeel.
Learning a tsume-go heuristic with Tilde.
In T. A. Marsland and I. Frank, editors, Computers and Games: Proceedings
of the 2nd International Conference (CG-00), volume 2063 of
Lecture Notes in Computer Science, pages 151-169, Hamamatsu,
Japan, 2001. Springer-Verlag.
[Go] [ILP] [y]
- [372]
- Jan Ramon, Tom Francis, and Hendrik
Blockeel.
Learning a
Go heuristic with Tilde.
In Proceedings of the 12th Belgian-Dutch Conference on Artificial
Intelligence, 2000.
[Go] [ILP] [y]
- [373]
- Mohammad Raonak-Uz-Zaman.
Applications of Neural Networks in Computer Go.
PhD thesis, Texas Tech University, 1998.
[Go] [Neural Network, Ensembles] [n]
- [374]
- Mary Jo Rattermann and Susan L.
Epstein.
Skilled like a person: A comparison of human and computer game playing.
In Proceedings of the 17th Annual Conference of the Cognitive Science
Society, pages 709-714, Pittsburgh, PA, 1995. Lawrence Erlbaum
Associates.
[Tic-Tac-Toe, Achi] [] [y]
- [375]
- Christian Reiser and Hermann Kaindl.
Case-based reasoning for multi-step problems and its integration with heuristic
search.
In Proceedings of the AAAI-94 Workshop on Case-Based Reasoning,
number WS-94-01, pages 101-105. AAAI Press, 1994.
[Abalone] [CBR] [y]
- [376]
- H. Remus.
Simulation of a learning machine for playing Go.
In Proceedings of the International Federation of Information Processing
Congress (IFIP), Munich, 1962. North-Holland.
[Go] [] [n]
- [377]
- H. Remus.
Simulation of a learning machine for playing Go.
In D. N. L. Levy, editor, Computer Games II. Springer Verlag,
1988.
[Go] [] [n]
- [378]
- Patrick Ricaud.
Abstraction mechanisms to modelize human strategy in the game of go.
In Proceedings of the 8th International Conference on Artificial
Intelligence Applications (EXPERSYS-96), 1996.
[Go] [] [n]
- [379]
- Norman Richards, David Moriarty, Paul
McQuesten, and Risto Miikkulainen.
Evolving neural networks to play Go.
In Proceedings of the 7th International Conference on Genetic
Algorithms, East Lansing, MI, 1997.
[Go] [Neural Network, Evolutionary] [y]
- [380]
- Norman Richards, David Moriarty, and
Risto Miikkulainen.
Evolving neural networks to play Go.
Applied Intelligence, 8(1):85-96, 1998.
Special Issue on Evolutionary Learning.
[Go] [Neural Network, Evolutionary] [y]
- [381]
- P. I. Richards.
On game-learning machines.
The Scientific Monthly, pages 201-205, April 1952.
[Chess] [Rote Learning] [n]
- [382]
- Jack van Rijswijck.
Learning
from perfection: A data mining approach to evaluation function learning in
awari.
In T. A. Marsland and I. Frank, editors, Computers and Games: Proceedings
of the 2nd International Conference (CG-00), volume 2063 of
Lecture Notes in Computer Science, pages 115-132, Hamamatsu,
Japan, 2001. Springer-Verlag.
[Awari] [Constructive Induction] [y]
- [383]
- Julia Bowman Robinson.
An iterative method of solving a game.
Annals of Mathematics, 54:296-301, 1951.
[Game Theory] [] [n]
- [384]
- T. Robinson and F. Fallside.
Dynamic reinforcement driven error propagation networks with application to
game playing.
In Proceedings of the 11th Annual Conference of the Cognitive Science
Society, pages 836-843, Hillsdale, NJ, 1989. Lawrence Erlbaum.
[Tic-Tac-Toe] [Neural Network, Reinforcement] [n]
- [385]
- Christopher D. Rosin and Richard K.
Belew.
Finding opponents
worth beating: Methods for competitive co-evolution.
In Proceedings of the 6th International Conference on Genetic
Algorithms, 1995.
[Tic-Tac-Toe, Nim, Go] [Evolutionary] [y]
- [386]
- Christopher D. Rosin and Richard K.
Belew.
A competitive
approach to game learning.
In Proceedings of the 9th Annual ACM Conference on Computational Learning
Theory (COLT-96), pages 292-302, 1996.
[] [] [y]
- [387]
- Christopher D. Rosin.
Coevolutionary search among adversaries.
PhD thesis, University of California, San Diego, CA, 1997.
[Tic-Tac-Toe, Nim, Go] [Evolutionary] [y]
- [388]
- Christopher D. Rosin and Richard K.
Belew.
New methods for
competitive coevolution.
Evolutionary Computation, 5(1):1-29, 1997.
[Tic-Tac-Toe, Nim] [Evolutionary] [y]
- [389]
- Arthur L. Samuel.
Some studies in machine learning using the game of checkers.
IBM Journal of Research and Development, 3(3):211-229, 1959.
[Checkers] [TD] [y]
- [390]
- Arthur L. Samuel.
Machine learning.
Technology Review, 62:42-45, 1959.
[Checkers] [TD] [n]
- [391]
- Arthur L. Samuel.
Programming computers to play games.
In Advances in Computers 1, pages 165-192. Academic Press, 1960.
[Checkers] [TD] [n]
- [392]
- Arthur L. Samuel.
Some studies in machine learning using the game of checkers. ii - recent
progress.
IBM Journal of Research and Development, 11(6):601-617, 1967.
[Checkers] [TD] [y]
- [393]
- Tuomas W. Sandholm and Robert H.
Crites.
Multiagent reinforcement learning in the iterated prisoner's dilemma.
Biosystems, 37(1-2):147-146, January 1995.
Special Issue on the Prisoner's Dilemma.
[Game Theory, Prisoner's Dilemma] [Reinforcement] [n]
- [394]
- Scott Sanner, John R. Anderson,
Christian Lebiere, and Marsha Lovett.
Achieving efficient
and cognitively plausible learning in backgammon.
In P. Langley, editor, Proceedings of the 17th International Conference
on Machine Learning (ICML-00), pages 823-830, Stanford, CA, 2000.
Morgan Kaufmann.
[Backgammon] [] [y]
- [395]
- Nobusuke Sasaki, Yasuji Sawada, and Jin
Yoshimura.
A neural network program of tsume-go.
In H. J. van den Herik and H. Iida, editors, Proceedings of the First
International Conference on Computers and Games (CG-98), volume 1558
of Lecture Notes in Computer Science, page 167, Tsukuba, Japan,
1998. Springer-Verlag.
[Go] [Neural Network] [n]
- [396]
- Ken Sato, Hitoshi Matsubara, Takuji
Shinohara, and Kentaro Kayama.
Learning weights in similarity functions for Shogi positions.
In H. Matsubara, editor, Proceedings of the 4th Game Programming
Workshop, Tokyo, Japan, 1997. Computer Shogi Association.
In Japanese.
[Shogi] [CBR] [n]
- [397]
- Johannes Schäfer.
Erfolgsorientiertes Lernen mit Tiefensuche in Bauernendspielen.
Technical report, Universität Karlsruhe, 1993.
In German.
[Chess] [] [n]
- [398]
- Jonathan Schaeffer.
Learning from (other's) experience.
In H. Berliner, editor, Proceedings of the AAAI Spring Symposium on
Computer Game Playing, pages 51-53, Stanford University, 1988.
[Chess] [CBR] [y]
- [399]
- Jonathan Schaeffer, Darse Billings,
Lourdes Pe~na, and Duane Szafron.
Learning to play strong poker.
In Fürnkranz and Kubat [195].
[Poker] [Statistical] [y]
- [400]
- Jonathan Schaeffer.
The games computers (and people) play.
In M. V. Zelkowitz, editor, Advances in Computers, volume 50,
pages 189-266. Academic Press, 2000.
[Poker, Scrabble, Backgammon] [Reinforcement, TD, Neural Network,
Statistical] [y]
- [401]
- Jonathan Schaeffer, Markian Hlynka,
and Vili Jussila.
Temporal difference learning applied to a high performance game.
In Proceedings of the 17th International Joint Conference on Artificial
Intelligence (IJCAI-01), 2001.
[Checkers] [Reinforcement, TD] [y]
- [402]
- Tony Scherzer, Linda Scherzer, and
D. Tjaden.
Learning in Bebe.
In T. A. Marsland and J. Schaeffer, editors, Computers, Chess, and
Cognition, chapter 12, pages 197-216. Springer Verlag, 1990.
[Chess] [CBR] [y]
- [403]
- Tony Scherzer, Linda Scherzer, and
D. Tjaden.
Learning in bebe.
International Computer Chess Association Journal, 14(4):183-191,
1991.
[Chess] [CBR] [y]
- [404]
- Michael Schlosser.
A test-bed for investigations in machine learning.
GOSLER Report 18/92, Hochschule für Technik, Wirtschaft und Kultur,
Leipzig, October 1992.
[Chess] [] [y]
- [405]
- Michael Schlosser.
Knowledge discovery in endgame databases.
In X. Liu, P. Cohen, and M. Berthold, editors, Advances in Intelligent
Data Analysis (IDA-97), volume 1280 of Lecture Notes in Computer
Science, London, U.K., 1997. Springer.
[Chess] [Symbolic] [n]
- [406]
- Martin Schmidt.
Neural networks
and chess.
Master's thesis, Computer Science Department, University of Aarhus, Aarhus,
Denmark, 1993.
[Chess] [Neural Network] [y]
- [407]
- Martin Schmidt.
Temporal-difference learning and chess.
Technical report, Computer Science Department, University of Aarhus, Aarhus,
Denmark, 1994.
[Chess] [TD] [y]
- [408]
- Nicol N. Schraudolph, Peter Dayan,
and Terrence J. Sejnowski.
Temporal difference learning
of position evaluation in the game of go.
In J. D. Cowan, G. Tesauro, and J. Alspector, editors, Advances in Neural
Information Processing 6, pages 817-824. Morgan Kaufmann, San
Francisco, 1994.
[Go] [TD] [y]
- [409]
- Stefan Schrödl.
Explanation-based generalization in game playing: Quantitative results.
In C. Nédellec and C. Rouveirol, editors, Proceedings of the 10th
European Conference on Machine Learning (ECML-98), pages 256-267,
Chemnitz, Germany, 1998. Springer-Verlag.
[Chess] [EBL] [y]
- [410]
- Alan C. Schultz and Kenneth A. De
Jong.
An adaptive othello player: Experience-based learning applied to game playing.
In H. Berliner, editor, Proceedings of the AAAI Spring Symposium on
Computer Game Playing, pages 46-47, Stanford University, Palo Alto,
CA, 1988.
[Othello] [CBR] [y]
- [411]
- Jay Scott.
Machine learning in games.
[] [] [y]
- [412]
- S. Sei and T. Kawashima.
The experiment of Go program KATSUNARI using memory-based reasoning.
In H. Matsubara, editor, Proceedings of the 3rd Game Programming
Workshop, Hakone, Japan, 1996.
In Japanese.
[Go] [CBR] [n]
- [413]
- Alen D. Shapiro and Tim Niblett.
Automatic induction of classification rules for a chess endgame.
In M. R. B. Clarke, editor, Advances in Computer Chess 3, pages
73-92. Pergamon Press, Oxford, U.K., 1982.
[Chess] [Inductive] [y]
- [414]
- Alen D. Shapiro and Donald Michie.
A self commenting facility for inductively synthesized endgame expertise.
In D. F. Beal, editor, Advances in Computer Chess 4, pages
147-165. Pergamon Press, Oxford, U.K., 1986.
[Chess] [Inductive] [y]
- [415]
- Alen D. Shapiro.
Structured Induction in Expert Systems.
Turing Institute Press. Addison-Wesley, 1987.
[Chess] [Inductive] [y]
- [416]
- Brian Sheppard.
Mastering Scrabble.
IEEE Intelligent Systems, 14(6):15-16, November/December 1999.
Research Note.
[Scrabble] [Reinforcement] [y]
- [417]
- Steven S. Skiena.
An overview of machine learning in computer chess.
International Computer Chess Association Journal, 9(1):20-28,
1986.
[Chess] [] [y]
- [418]
- David J. Slate.
A chess program that uses its transposition table to learn from experience.
International Computer Chess Association Journal, 10(2):59-71,
1987.
[Chess] [] [n]
- [419]
- J.J. Smeets and G. Putter.
Some experience with a self-learning computer program for playing draughts.
In D. N. Levy and D. F. Beal, editors, Heuristic Programming in
Artificial Intelligence --- The First Computer Olympiad, pages
176-194. Ellis Horwood, Chichester, England, 1989.
[Checkers] [] [n]
- [420]
- Stephen F. Smith.
Flexible learning of problem solving heuristics through adaptive search.
In Proceedings of the 8th International Joint Conference on Artificial
Intelligence (IJCAI-83), pages 421-425, Los Altos, CA, 1983. Morgan
Kaufmann.
[Poker] [Evolutionary] [y]
- [421]
- Peer Sommerlund.
Artificial neural nets
applied to strategic games, May 1996.
[] [Neural Networks] [y]
- [422]
- Stephan F. da Silva.
Go and genetic
programming (playing Go with filter functions).
Master's thesis, Department of Computer Science, Rijksuniversiteit Leiden, The
Netherlands, November 1996.
[Go] [Evolutionary] [y]
- [423]
- James C. Spohrer.
Learning plans through experience: A first pass in the chess domain.
In D. P. Casasent, editor, Intelligent Robots and Computer Vision,
volume 579 of Proceedings of the SPIE -- The International Society for
Optical Engineering, pages 518-527, 1985.
[Chess] [CBR] [y]
- [424]
- David Stoutamire.
Machine learning,
game play, and Go.
Technical Report TR-91-128, Center for Automation and Intelligent Systems
Research, Case Western Reserve University, 1991.
[Go] [] [y]
- [425]
- David Stoutamire.
Machine learning applied to Go.
Master's thesis, Case Western Reserve University, 1991.
[Go] [] [y]
- [426]
- Csaba Szepesvári.
Learning and exploitation do not conflict under minimax optimality.
In M. van Someren and G. Widmer, editors, Proceedings of the 9th
European Conference on Machine Learning (ECML-97), number 1224 in
Lecture Notes in Artificial Intelligence, pages 242-249, Prague, Czech
Republic, 1997. Springer-Verlag.
[Tic-Tac-Toe] [Reinforcement] [y]
- [427]
- Prasad V. Tadepalli.
Learning approximate plans in games.
Technical Report ML-TR-8, Rutgers University, 1986.
[Chess] [] [n]
- [428]
- Prasad V. Tadepalli.
Lazy explanation-based learning: A solution to the intractable theory problem.
In Proceedings of the 11th International Joint Conference on Artificial
Intelligence (IJCAI-89), pages 694-700. Morgan Kaufmann, 1989.
[Chess] [EBL] [y]
- [429]
- Prasad V. Tadepalli.
Planning in games using approximately learned macros.
In A. M. Segre, editor, Proceedings of the Sixth International Workshop
on Machine Learning, pages 221-223. Morgan Kaufmann, 1989.
[Chess] [EBL] [y]
- [430]
- Gerald Tesauro.
Neural
network defeats creator in backgammon match.
Technical Report CCSR-88-6, Center for Complex Systems Research, University of
Illinois, Urbana-Champaign, IL, 1988.
[Backgammon] [Neural Network] [y]
- [431]
- Gerald Tesauro and Terrence J.
Sejnowski.
A parallel network that learns to play backgammon: Recent results.
In H. Berliner, editor, Proceedings of the AAAI Spring Symposium on
Computer Game Playing, pages 41-45, Stanford University, 1988.
[Backgammon] [Neural Network] [y]
- [432]
- Gerald Tesauro.
Connectionist learning of expert backgammon evaluations.
In Proceedings of the 5th International Conference on Machine Learning
(ICML-88), pages 200-206, Ann Arbor, MI, 1988.
[Backgammon] [Neural Network] [y]
- [433]
- Gerald Tesauro and Terrence J.
Sejnowski.
A
parallel network that learns to play backgammon.
Artificial Intelligence, 39:357-390, 1989.
[Backgammon] [Neural Network] [y]
- [434]
- Gerald Tesauro.
Connectionist learning of expert preferences by comparison training.
In D. Touretzky, editor, Advances in Neural Information Processing
Systems 1 (NIPS-88), pages 99-106. Morgan Kaufmann, 1989.
[Comparison Training, Backgammon] [Neural Network] [n]
- [435]
- Gerald Tesauro.
Neurogammon: a neural-network backgammon learning program.
In D. N. L. Levy and D. F. Beal, editors, Heuristic Programming in
Artificial Intelligence: The First Computer Olympiad, pages 78-80.
Ellis Horwood, 1989.
[Backgammon] [Neural Network] [n]
- [436]
- Gerald Tesauro.
Neurogammon: A neural network backgammon program.
In Proceedings of the International Joint Conference on Neural Networks
(IJCNN-90), volume III, pages 33-39, San Diego, CA, 1990. IEEE.
[Backgammon] [Neural Network] [y]
- [437]
- Gerald Tesauro.
Temporal difference learning of backgammon strategy.
Proceedings of the 9th International Conference on Machine
Learning, pages 451-457, 1992.
[Backgammon] [TD] [y]
- [438]
- Gerald Tesauro.
Practical issues
in temporal difference learning.
Machine Learning, 8:257-278, 1992.
[Backgammon] [TD] [y]
- [439]
- Gerald Tesauro.
TD-Gammon, a self-teaching backgammon program, achieves master-level
play.
In Epstein and Levinson [140],
pages 19-23.
[Backgammon] [TD] [y]
- [440]
- Gerald Tesauro.
TD-Gammon, a self-teaching backgammon program, achieves master-level play.
Neural Computation, 6(2):215-219, 1994.
[Backgammon] [TD] [y]
- [441]
- Gerald Tesauro.
Temporal difference
learning and TD-Gammon.
Communications of the ACM, 38(3):58-68, March 1995.
[Backgammon] [TD] [y]
- [442]
- Gerald Tesauro and Gregory R.
Galperin.
On-line policy improvement using Monte-Carlo search.
In M. C. Mozer, M. I. Jordan, and T. Petsche, editors, Advances in Neural
Information Processing Systems 9 (NIPS-96), pages 1068-1074. The
MIT Press, 1997.
[Backgammon] [Statistical] [y]
- [443]
- Gerald Tesauro.
Comments on 'Co-evolution in the successful learning of backgammon strategy'.
Machine Learning, 32(3):241-243, 1998.
[Backgammon] [Evolutionary, TD] [y]
- [444]
- Gerald Tesauro.
Comparison training of chess evaluation functions.
In Fürnkranz and Kubat [197], chapter 6, pages 117-130.
[Chess] [Comparison Training] [y]
- [445]
- Gerald Tesauro.
Programming backgammon using self-teaching neural nets.
Artificial Intelligence, 134(1-2):181-199, January 2002.
Special Issue on Games, Computers and Artificial Intelligence.
[Backgammon] [TD, Neural Network] [y]
- [446]
- Sebastian Thrun.
Learning to play the game of chess.
In G. Tesauro, D. Touretzky, and T. Leen, editors, Advances in Neural
Information Processing Systems 7, pages 1069-1076. The MIT Press,
Cambridge, MA, 1995.
[Chess] [TD, EBL, Neural Network, Inductive] [y]
- [447]
- A. van Tiggelen.
Neural networks as a guide to optimization. The chess middle game explored.
International Computer Chess Association Journal, 14(3):115-118,
1991.
[Chess] [Neural Network] [y]
- [448]
- A. van Tiggelen and H. Jaap van den
Herik.
ALEXS: An optimization approach for the endgame KNNKP(h).
In D. F. Beal, editor, Advances in Computer Chess 6, pages
161-177. Ellis Horwood, Chichester, 1991.
[Chess] [Evolutionary] [n]
- [449]
- W. Tunstall-Pedoe.
Genetic algorithms optimizing evaluation functions.
International Computer Chess Association Journal, 14(3):119-128,
1991.
[Chess] [Evolutionary] [y]
- [450]
- Joseph Turian.
Automated
feature selection to maximize learning in artificial intelligence.
Unpublished Manuscript available at
http://www.ai.mit.edu/people/jude/research/research.html, 1996.
[Backgammon] [Neural Network] [y]
- [451]
- Paul E. Utgoff and Peter Stephen
Heitman.
Learning and generalizing move selection preferences.
In H. Berliner, editor, Proceedings of the AAAI Spring Symposium on
Computer Game Playing, pages 36-40, Stanford University, 1988.
[Othello] [] [y]
- [452]
- Paul E. Utgoff and Jeffery Clouse.
Two kinds of training information for evaluation function learning.
In Proceedings of the 9th National Conference on Artificial Intelligence
(AAAI-91), pages 596-600, Anaheim, CA, 1991. AAAI Press.
[] [TD] [y]
- [453]
- Paul E. Utgoff.
Feature function learning for value function approximation.
Technical Report 96-09, Department of Computer Science, University of
Massachusetts, Amherst, MA, January 1996.
[Tic-Tac-Toe] [TD, Constructive Induction] [y]
- [454]
- Paul E. Utgoff and Doina Precup.
Constructive function approximation.
Technical Report 97-04, Department of Computer Science, University of
Massachusetts, Amherst, MA, 1997.
[Checkers] [Constructive Induction] [y]
- [455]
- Paul E. Utgoff and Doina Precup.
Constructive function approximation.
In H. Liu and H. Motoda, editors, Feature Extraction, Construction and
Selection: A Data Mining Perspective, volume 453 of The Kluwer
International Series in Engineering and Computer Science, chapter 14.
Kluwer Academic Publishers, 1998.
[Checkers] [Constructive Induction] [n]
- [456]
- Paul E. Utgoff.
Feature construction for game playing.
In Fürnkranz and Kubat [197], chapter 7, pages 131-152.
[] [] [y]
- [457]
- William T. B. Uther and Manuela M.
Veloso.
Generalizing adversarial reinforcement learning.
In Proceedings of the AAAI Fall Symposium on Model Directed Autonomous
Systems, 1997.
[Grid Soccer] [Reinforcement] [y]
- [458]
- William T. B. Uther and Manuela M.
Veloso.
Adversarial reinforcement learning.
Carnegie Mellon University, April 1997.
Unpublished Manuscript.
[Grid Soccer] [Reinforcement] [y]
- [459]
- H. Jaap van den Herik and L. V.
Allis, editors.
Heuristic Programming in Artificial Intelligence 3 -- The Third Computer
Olympiad.
Ellis Horwood, Chichester, England, 1992.
[] [] [n]
- [460]
- T. F. Verhoef and J. H. Wesselius.
Two-ply KRKN: Safely overtaking Quinlan.
International Computer Chess Association Journal, 10(4):181-190,
1987.
[Chess] [Inductive] [y]
- [461]
- Steven Walczak.
Predicting actions from induction on past performance.
In L. Birnbaum and G. Collins, editors, Proceedings of the 8th
International Workshop on Machine Learning (ML-91), pages 275-279.
Morgan Kaufmann, 1991.
[Chess] [Inductive] [y]
- [462]
- Steven Walczak.
Developing opening strategies by analyzing an opponent's game history.
International Computer Chess Journal, 14(1):21-22, 1991.
[] [] [n]
- [463]
- Steven Walczak.
Pattern-based tactical planning.
International Journal of Pattern Recognition and Artificial
Intelligence, 6(5):955-988, 1992.
[Chess, Hex] [Inductive] [y]
- [464]
- Steven Walczak and Douglas D. Dankel
II.
Acquiring tactical and strategic knowledge with a generalized method for
chunking of game pieces.
International Journal of Intelligent Systems, 8(2):249-270, 1993.
Reprinted in K. Ford and J. Bradshaw (Eds.) Knowledge Acquisition As
Modeling, New York: Wiley.
[Chess, Go] [Inductive] [n]
- [465]
- Steven Walczak and Douglas D. Dankel
II.
Acquiring tactical and strategic knowledge with a generalized method for
chunking of game pieces.
In K. Ford and J. Bradshaw, editors, Knowledge Acquisition as
Modeling, pages 249-270. John Wiley, 1993.
[Chess, Go] [Inductive] [n]
- [466]
- Steven Walczak and James Krause.
Chaos, neural networks and gaming.
In E. A. Yfantis, editor, Intelligent Systems, pages 457-466.
Kluwer Academic, Dordrecht, The Netherlands, 1995.
[] [Neural Network] [n]
- [467]
- Steven Walczak.
Improving
opening book performance through modeling of chess opponents.
In Proceedings of the 24th ACM Annual Computer Science Conference,
pages 53-57, 1996.
[Chess] [Inductive] [y]
- [468]
- Steven Walczak and Reijer Grimbergen.
Pattern analysis and analogy in shogi: Predicting shogi moves from prior
experience.
Knowledge and Information Systems: An International Journal, 2(2),
May 2000.
[Shogi] [] [n]
- [469]
- Steven Walker, Raymond Lister, and Tom
Downs.
On self-learning patterns in the othello board game by the method of temporal
differences.
In C. Rowles, H. Liu, and N. Foo, editors, Proceedings of the 6th
Australian Joint Conference on Artificial Intelligence, pages
328-333, Melbourne, 1993. World Scientific.
[Othello] [TD, Neural Network] [n]
- [470]
- Steven Walker, Raymond Lister, and Tom
Downs.
Temporal difference, non-determinism, and noise: A case study on the 'othello'
board game.
In M. Marinaro and P. Morasso, editors, Proceedings of the International
Conference on Artificial Neural Networks (ICANN-94), pages 328-333.
Springer, 1994.
[Othello] [TD, Neural Network] [y]
- [471]
- D. A. Waterman.
Machine Learning of Heuristics.
PhD thesis, Computer Science Department, Stanford University, 1968.
Report No. STAN-CS-68-118.
[Poker] [] [n]
- [472]
- D. A. Waterman.
A generalization learning technique for automating the learning of heuristics.
Artificial Intelligence, 1:121-170, 1970.
[Poker] [] [n]
- [473]
- Lex Weaver and Terry Bossomaier.
Evolution of neural networks to play the game of dots-and-boxes.
In Artificial Life V: Poster Presentations, pages 43-50, 1996.
[Dots-and-Boxes] [Neural Network, Evolutionary] [y]
- [474]
- Ryan J. Weber and Robert A. Levinson.
Pattern-level temporal difference learning, data fusion, and chess.
In Proceedings of SPIE's 14th Annual Conference on Aerospace/Defense
Sensing and Controls (AEROSENSE-00), 2000.
[Chess] [TD] [n]
- [475]
- Jean-Christophe Weill.
How hard is the
correct coding of an easy endgame.
In H. J. van den Herik, I. S. Herschberg, and J. W. H. M. Uiterwijk, editors,
Advances in Computer Chess 7, pages 163-176. University of
Limburg, 1994.
[Chess] [Inductive] [y]
- [476]
- Erik C. D. van der Werf and H. Jaap
van den Herik.
Visual learning in Go.
In Jos W. H. M. Uiterwijk, editor, Proceedings of the 6th Computer
Olympiad Computer-Games Workshop, pages 25-30, Maastricht, NL, August
2001. IKAT, Department of Computer Science, Universiteit Maastricht.
Technical Report CS 01-04.
[Go] [Neural Network] [y]
- [477]
- B. Widrow, N. K. Gupta, and S. Maitra.
Punish/reward: Learning with a critic in adaptive threshold systems.
IEEE Transactions on Systems, Man, and Cybernetics, 3:455-465,
1973.
[BlackJack] [Reinforcement] [n]
- [478]
- Marco A. Wiering.
TD learning of game evaluation functions with hierarchical neural
architectures.
Master's thesis, Department of Computer Systems, University Amsterdam, April
1995.
[Tic-Tac-Toe, Backgammon] [TD, Neural Network] [y]
- [479]
- S. Yakowitz.
A statistical foundation for machine learning, with application to go-moku.
Computers and Mathematics with Applications, 17(7):1095-1102,
1989.
[Go-Moku] [Statistical] [n]
- [480]
- Xin Yao and Paul Darwen.
Genetic algorithms and
evolutionary games.
In Commerce, Complexity and Evolution, pages 313-333. Cambridge
University Press, 2000.
[Game Theory] [Evolutionary] [y]
- [481]
- R. C. Yee, Sharad Saxena, Paul E. Utgoff,
and Andrew G. Barto.
Explaining temporal differences to create useful concepts for evaluating
states.
In Proceedings of the 8th National Conference on Artificial Intelligence
(AAAI-90), pages 882-888, 1990.
[Tic-Tac-Toe] [TD, Reinforcement, EBL] [y]
- [482]
- He Yo, Zhen Xianjun, Ye Yizheng, and
Li Zhongrong.
Knowledge acquisition and reasoning based on neural networks --- the research
of a Bridge bidding system.
In Proceedings of the INNC-90, pages 416-423, Paris, 1990.
[Bridge] [Neural Network] [n]
- [483]
- Raonak Zaman, Danil Prokhorov, and
Donald C. Wunsch II.
Adaptive
critic design in learning to play game of Go.
In Proceedings of the IEEE/INNS International Conference on Neural
Networks (ICNN-97), pages 416-423, Houston, TX, 1990.
[Go] [TD, Neural Network] [y]
- [484]
- Raonak Zaman and Donald C. Wunsch II.
TD methods applied to mixture of
experts for learning 9x9 Go evaluation function.
In Proceedings of the IEEE/INNS International Joint Conference on Neural
Networks (IJCNN-99), 1999.
[Go] [TD, Neural Network] [y]
- [485]
- Bidan Zhu.
Ramsey theory illustrated
through a Java based game that learns in a client-server style to play
heuristically and plays perfectly if possible.
ÖGAI Journal, 17:28-31, 1998.
[Hexi] [Reinforcement] [y]
- [486]
- Albert L. Zobrist and Frederic R.
Carlson.
An advice-taking chess computer.
Scientific American, 228(6):92-105, June 1973.
[Chess] [Advice] [y]