This article is from the Backgammon FAQ, by Mark Damish damish@ll.mit.edu with numerous contributions by others.
[Original list submited by Mika Johnsson] [sorted by date]
Hans Berliner: ``A Program that Plays Backgammon''
SIGART Newsletter No. 54, October 1975
E.B. Keeler, J. Spencer: ``Optimal doubling in Backgammon''
Operations Research Vol. 23 No. 6, November-December 1975
P.J. Orth: ``A Comment on "Optimal Doubling in Backgammon''
Operations Research 24, 1179 (1976)
David Levner: ``Is Brute Force Backgammon Possible ?''
SIGART newsletter No. 58, June 1976
N. Zadeh: ``On Doubling in Tournament Backgammon''
Management Science 23, 986-993 (1977)
N. Zadeh and G.Kobliska: ``On optimal doubling in backgammon''
Management Science 23, 853-858 (1977)
Hans Berliner: ``Backgammon computer program beats world champion''
Artificial intelligence 14 (1980), 205-220
Hans Berliner: ``Computer Backgammon''
Scientific American 243:1, 64-72 (1980)
An on-line summary by Dr. Berliner of his work in ai/games is
found under his name at either:
"http://www.cs.cmu.edu/afs/cs.cmu.edu/misc/mosaic/common/omeg
a/web/frg.txt
http://www.cs.cmu.edu/afs/cs.cmu.edu/user/burks/frg.95
G. Tesauro: ``Neurogammon wins Computer Olympiad.''
Neural computation 1, 321-323 (1989)
G.Tesauro, T.J.Sejnowski: ``A parallel network that learns to play
Backgammon''
Artificial intelligence 39 (1989) 357-390
G. Tesauro, ``Neurogammon: a neural network backgammon program.''
IJCNN Proceedings vol. III, 33-40 (1990).
G. Tesauro, ``Practical issues in temporal difference learning.''
Machine Learning vol. 8, 257-277 (1992).
G. Tesauro, ``TD-Gammon, a self-teaching backgammon program, achieves
master-level play.''
Neural Computation, vol. 6, 215-219 (1994).
G. Tesauro, ``Temporal Difference Learning and TD-Gammon''
Communications of the ACM, Vol.38, No.3, 58-68 (March 1995)
http://forum.swarthmore.edu/~jay/learn-game/systems/gammon.html
Jay Scott's backgammon in his Machine Learning in Games site.
 
Continue to: