CMSC-791 Computer Chess: Readings

Required Readings

1. Hsu, Feng-hsiung; Thomas Anantharaman; Murray Campbell; and Andreas Nowatzyk, ``A grandmaster chess machine,'' Scientific American, 263:4 (October 1990), 44-50.

2. Hartman, D., ``Notions of evaluation functions tested against grandmaster games'' in Advances in Computer Chess, D. F. Beal, editor, North-Holland, 1989, 91-141.

3. Plaat, Aske; j. Schaeffer; W. Pijls; and A. de Bruin, ``A minimax algorithm better than alpha-beta? No and Yes,'' (July 6, 1995), unpublished manuscript. 46 pages.

4. Thompson, Ken, ``Retrograde analysis of certain endgames,'' ICCA Journal (Sept. 1986), 131-139.

5. Lake, Robert; Jonathan Schaffer; and Paul Lu, ``Solving large retrograde analysis problems using a network of workstations,'' unpublished paper, Dept. of Computer Science, University of Alberta. 32 pages.

6. Stiller, Lewis, ``Group graphs and computational symmetry on massively parallel architecture,'' Journal of Supercomputing, vol 5, (1991), 99-117.

7. Stiller, Lewis, ``Two computer-generated optimal play lines from extreme positions,'' Dept. of Computer Science, Johns Hopkins University, undated unpublished manuscript.

8. Anantharaman, Thomas, Murray S. Campbell, and Feng-hsiung Hsu, ``Singular extensions: Adding selectivity to brute-force searching,'' Artificial Intelligence, vol 43 (1990), 99-109.

9. Schaeffer, Jonathan, ``The history heuristic and alpha-beta search enhancements in practice,'' undated unpublished manuscript, 28 pages.

10. McAllester, David A., and Deniz Yuret, ``Alpha-Beta-Conspiracy Search,'' MIT AI Lab, (Draft: October 20, 1993), unpublished manuscript, 39 pages.

11. Beal, Don F., ``A generalized quiescence search algorithm,'' Artificial Intelligence, vol 43 (1990), 85-98.

12. Joerg, Christopher F., and Bradley C. Kuszmaul, ``Massively parallel chess,'' to be presented at DIMACS '94 Challenge (October 1994), 16 pages.

13. Diderich, Claude G., ``A bibliography on minimax trees,'' Theoretical Computer Science Lab, Lsusanne (Aprin 2, 1993), Swiss Federal Institute of Technology, unpublished manuscript, 7 pages.

14. Storer, James A., ``The complexity of chess,'' Computer Science Dept., Brandeis University, (August 1, 1982), unpublished manuscript, 26 pages.

15. Wilkens, David, ``Using patterns and plans in chess,'' Artificial Intelligence, vol. 14 (1980), 165-203.

16. Levinson, Robert, ``Experienced-based creativity,'' Dept. of Computer and Info. Sciences, Univ. of California Santa Cruz, undated unpublished manuscript, 36 pages.

17. Horacek, Helmut, ``Reasoning with uncertainty in computer chess,'' Artificial Intelligence, vol. 43 (1990), 37-56.

18. Breuker, D. M., J. W. H. M. Uiterwijk, and H. J. van den Herik, ``Replacement schemes for transposition tables,'' Maastricht, The Netherlands, undated unpublished manuscript, 8 pages.

19. Hyatt, Robert, Source code to Crafty.

Suggested Readings

Books

• Levy, David; and Monty Newborn, How Computers Play Chess, Computer Science Press (New York, 1991).

• Marsland, T. A.; and J. Schaeffer, Computers, Chess, and Cognition, Springer-Verlag (New York, 1990).

• Elkies, Noam D., ``Chess art in the computer age,'' American Chess Journal, no. 2 (1993), 48-62.

• Proceedings of the 1996 ACM COmputer Science Conference, held February 16-18, 1996, in Philadelphia, PA.

Journals

• Journal of the International Computer Chess Association (ICCA Journal). Contents.

Articles

Technical Reports

• ``Games: Planning & learning. Papers from the 1993 Fall Symposium,'' Technical Report FS-93-02, AAAI Press (Menlo Park, CA, 1993).

Newsgroups

• rec.games.chess.computer