Genetically programmed strategies for chess endgame

GECCO 2006 - Genetic and Evolutionary Computation Conference

Volumn 1, Issue , 2006, Pages 831-838

  Lassabe, Nicolas ^a   Sanchez, Stéphane ^a   Luga, Hervé ^a   Duthen, Yves ^a  

^a UNIVERSITY OF TOULOUSE CAPITOLE   (France)

Author keywords

Chess; Evolving strategies; Genetic Programming

Indexed keywords

GAME THEORY; PATTERN RECOGNITION; PROBLEM SOLVING; STRATEGIC PLANNING;

EVOLVING STRATEGIES; GENETIC PROGRAMMING;

GENETIC ALGORITHMS;

EID: 33750229313     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143997.1144144     Document Type: Conference Paper

References (19)

1. M. Autonès, A. Beck, P. Camacho, N. Lassabe, H. Luga, and F. Scharffe. Evaluation of chess position by modular neural network generated by genetic algorithm. In EuroGP, pages 1-10, 2004.
2. M. Bain and S. Muggleton. Learning optimal chess strategies. In Machine Intelligence 13, pages 291-309, 1994.
3. J. Burmeister and J. Wiles. The challenge of go as a domain for ai research: a comparison between go an chess. In Proceedings of the Third Australian and New Zealand Conference on Intelligent Information Systems IEEE Conference on Evolutionary Computation, volume volume 2, 1995.
4. A. E. Elo. The Rating of Chessplayers, Past and Present. Arco Pub., New York, 2nd edition, 1978.
5. G. J. Ferrer and W. N. Martin. Using genetic programming to evolve board evaluation functions for a boardgame. In 1995 IEEE Conference on Evolutionary Computation, volume 2, page 747, Perth, Australia, 29 - 1 1995. IEEE Press.
6. D. Gleich. Machine learning in computer chess: Genetic programmig and krk, 2003.
7. R. Groß, K: Albrecht, W. Kantschik, and W. Banzhaf. Evolving chess playing programs. In GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 740-747. Morgan Kaufmann Publishers, 2002.
8. A. Hauptman and M. Sipper. GP-endchess: Using genetic programming to evolve chess endgame players. In Proceedings of the 8th European Conference on Genetic Programming, volume 3447 of Lecture Notes in Computer Science, pages 120-131, Lausanne, Switzerland, 30 Mar. - 1 Apr. 2005. Springer.
9. G. Kendall and G. Whitwell. An evolutionary approach for the tuning of a chess evaluation function using population dynamics. In Proceedings of the 2001 Congress on Evolutionary Computation CEC2001, pages 995-1002. IEEE Press, 27-30 2001.
10. J. R. Koza. Genetic Programming: On the programming of Computers by Means of Natural Selection. MIT Press, Cambridge, Mass., 1992.
11. E. Morales. On learning how to play. In Advances in Computer Chess 8, pages 235-250. Universiteit Maastricht, 1997.
12. E. V. Nalimov, G. Haworth, and E. A. Heinz. Space-efficient indexing of endgame databases for chess. ICGA Journal, Vol. 23(No. 3): 148-162, 2000.
13. A. Newell, J. Shaw, and H. Simon. Chess-playing programs and the problem of complexity. IBM Journal of Research and Development, 2:320-335, 1958.
14. A. E. G. Robert M. Hyatt, Harry L. Nelson. Cray blitz. In. in Computers, Chess, and Cognition, pages 111-130. Springer-Verlag, 1990.
15. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs, NJ, 1995.
16. Y. Seirawan, H. Simon, and T. Munakata. The implications of kasparov vs. deep blue. Commun. ACM 40(8), pages 21-25, 1997.
17. G. Shannon. Programming a computer for playing chess. Phil. Mag., 41:256-275, 1950.
18. H. Simon and W. Chase. Skill in chess. American Scientist, 61:394-403, 1973.
19. J.-C. Weill. How hard is the correct coding of an easy endgame. In H. J. v. d. Herik, I. S. Herschberg, and J. W. H. M. Uiterwijk, editors, Advances in Computer Chess 7, pages 163-176. University of Limburg, 1994.