Downloads

Beal, D.F. and Clarke, M.R.B. (1980). The Construction of Economical and Correct Algorithms for King and Pawn against King. Advances in Computer Chess 2 (ed. M.R.B. Clarke), pp. 1-30. Edinburgh University Press, Edinburgh. ISBN 0-85224-377-4. Beale, R. and Jackson, T. (1990). Neural Computing: An Introduction. Institute of Physics Publishing, Bristol. ISBN 0-8527-4262-2. Berliner, H. (1980). Computer Backgammon. Scientific American, Vol. 242, No. 6, pp. 54-62. ISSN 0036-8733. Bramer, M.A. (1980). An Optimal Algorithm for King and Pawn against King using Pattern Knowledge. Advances in Computer Chess 2 (ed. M.R.B. Clarke), pp. 82-96. Edinburgh University Press, Edinburgh. ISBN 0-85224-377-4. Bramer, M.A. (1982). Machine-Aided Refinement of Correct Strategies for the Endgame in Chess. Advances in Computer Chess 3 (ed. M.R.B. Clarke), pp. 93-112, esp. Appendix I. Pergamon Press, Oxford. ISBN 0-08-026898-6. Buro, M. (1995). Statistical Feature Combination for the Evaluation of Game Positions. Journal of Artificial Intelligence Research, Vol. 3, pp. 373-382. ISSN 1076-9757. Clarke, M.R.B. (1977). A Quantitative Study of King and Pawn Against King. Advances in Computer Chess 1 (ed. M.R.B. Clarke), pp. 108-118. Edinburgh University Press, Edinburgh. ISBN 0-85224-292-1. Edwards, S.J. (1994). Endgame Databases of Optimal Play to Mate. At publication time, this was to be found on the World Wide Web with ftp://chess.onenet.net/pub/chess/TB/ ... KPK.tbs/tbb/tbw Fürnkranz, J. (1996). Machine Learning in Computer Chess: the Next Generation. ICCA Journal, Vol. 19, No. 3, pp. 147-161. Hinde, C.J., Fletcher G.P., West A.A. and Williams, D.J. (1997). Neural Networks. ICL Technical Journal, Vol. 11 No. 2, pp. 244-278, esp. p. 259. ISSN 0142-1557. Hunt, E.B., Marin, J. and Stone, P. (1966). Experiments in Induction. Academic Press. LCC 65-26400. Messom, C.H. (1992). Engineering Reliable Neural Networks. Ph.D. thesis, Loughborough University, UK. Michie, D. (1980). Chess with Computers. Interdisciplinary Science Reviews. Vol. 5, No. 3, pp. 215-227. ISSN 0308-0188. Minsky, M.L. and Papert, S.A. (1969). Perceptrons, An Introduction to Computational Geometry. MIT Press, Cambridge, MA. Expanded edition (1988), MIT Press, Cambridge, Mass. ISBN 0-262-63111-3. Nunn, J. (1992). Secrets of Rook Endings. B.T. Batsford, London. ISBN 0-7134-7164-6. Nunn, J. (1994). Secrets of Pawnless Endings. B.T. Batsford, London. ISBN 0-7134-7508-0. Nunn, J. (1995). Secrets of Minor-Piece Endings. B.T. Batsford, London. ISBN 0-7134-7727-X. Quinlan, J.R. (1979). Discovering Rules by Induction from Large Collections of Examples. Expert Systems in the Micro-electronic Age. (ed. D. Michie), pp. 168-201. Edinburgh University Press, Edinburgh. ISBN 0-85224-381-2. Rich, E. and Knight, K. (1991). Artificial Intelligence. Second Edition. McGraw-Hill Book Company, New York, N.Y. ISBN 0-07-100894-2. Roycroft, A.J. and Thompson, K.L. (1986). Queen and Pawn on a6 against Queen. Roycroft’s 5-Men Chess Endgame Series, No. 2. Chess Endgame Consultants and Publishers, London. Roycroft, A.J. and Beal, D.F. (1991). To Make Dumb Endgame Databases Speak. Advances in Computer Chess 6 (ed. D.F. Beal), pp. 149-159. Ellis Horwood Ltd., Chichester, England. ISBN 0-13-006537-4. Rumelhart, D.E., Hinton, G.E. and Williams, R.J. (1987). Parallel Distributed Processing: Explorations in the Microstructure of Cognition, Vol. 1. MIT Press, Cambridge, Mass. ISBN 0-262-18120-7. Samuel, A.L. (1959). Some Studies in Machine Learning using the Game of Checkers. IBM Journal of Research and Development, Vol. 3, No. 3, pp. 210-229. ISSN 0018-8646. Reprinted (1963) in Computers and Thought (eds. E.A. Feigenbaum and J. Feldman), pp. 71-105. McGraw-Hill Book Company, New York, N.Y. ISBN 07-020370-9. Samuel, A.L. (1967). Some Studies in Machine Learning Using the Game of Checkers II Recent Progress. IBM Journal of Research and Development, Vol. 11, No. 6, pp. 601-617. ISSN 0018-8646. Reprinted (1970) in Human and Artificial Intelligence (ed. F.J. Crosson), pp. 81-116. Appleton-Century-Crofts, Educational Division, Meredith Corporation, New York, N.Y. ISBN 0-8919-7220-X. Shapiro, A.D. and Niblett, T. (1982). Automatic Induction of Classification Rules for a Chess Endgame. Advances in Computer Chess 3 (ed. M.R.B. Clarke), pp. 73-92. Pergamon Press, Oxford. ISBN 0-08-026898-6. Sutton, R. S. and Barto, A. G. (1998). Reinforcement Learning: An Introduction. (esp. Section 11.1). MIT Press, Cambridge, Mass. ISBN 0-2621-9398-1. Tesauro, G. (1992a). Practical Issues in Temporal Difference Learning. Machine Learning, Vol. 8, pp. 257-277. ISSN 0885-6125. Tesauro, G. (1992b). Temporal Difference Learning of Backgammon Strategy. Machine Learning: Proceedings of the 9th International Conference on Machine Learning 92 (eds. D. Sleeman and P. Edwards), pp. 451-457. Morgan Kaufmann, San Mateo, CA. ISBN 1-55860-247-X. Tesauro, G. (1994). TD-Gammon, a Self-Teaching Backgammon Program, achieves Master-Level Play. Neural Computation, Vol. 6, No. 2, pp. 215-219. ISSN 0899-7667. Tesauro, G. (1995). Temporal Difference Learning and TD-Gammon. Communications of the ACM, Vol. 38, No. 3, pp. 55-68. ISSN 0001-0782. Thompson, K. (1986). Retrograde Analysis of Certain Endgames. ICCA Journal, Vol. 9, No. 3, pp. 131-139. Walker, A.N. (1996). Hybrid Heuristic Search. ICCA Journal, Vol. 19, No. 1, pp. 17-23.