Learning playing strategies in chess

Computational Intelligence

Volumn 12, Issue 1, 1996, Pages 65-87

  Morales, Eduardo M ^a  

^a SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

Author keywords

Chess; First order induction; ILP; KPK; KRK; Machine learning

Indexed keywords

GAME THEORY; KNOWLEDGE BASED SYSTEMS; LEARNING ALGORITHMS; PROBLEM SOLVING;

CHESS; FIRST ORDER INDUCTION; PATTERN BASED KNOWLEDGE;

LEARNING SYSTEMS;

EID: 0030082039     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.1467-8640.1996.tb00253.x     Document Type: Article

References (33)

1. BERLINER, H. J. 1977. A representation and some mechanisms for a problem-solving chess program. In Advances in computer chess 1, Edited by M. R. B. Clarke. Edinburgh University Press. Edinburgh, pp. 7-29.
2. BRAMER, M. A. 1980. An optimal algorithm for king and pawn against king using pattern-knowledge. In Advances in Computer Chess. Edited by M. R. B. Clarke. Edinburgh University Press, Edinburgh, pp. 82-96.
3. BRATKO, I. 1982. Knowledge-based problem-solving in AL3. In Machine intelligence 10. Edited by J. E. Hayes, D. Michie, and Y. H. Pao. Ellis Horwood, UK, pp. 73-100.
4. BUNTINE, W. 1988. Generalised subsumption and its applications to induction and redundancy. Artificial Intelligence, 36(2): 149-176.
5. CHARNESS, N. 1977. Human chess skill. In Chess skills in man and machine. Edited by P. W. Fred. Springer-Verlag, Berlin, pp. 34-53.
6. CLARK, P. and T. NIBLETT. 1989. The CN2 induction algorithm. Machine Learning, 3(4):261-283.
7. DE GROOT, A. D. 1965. Thought and choice in chess. Mouton, The Hague.
8. DE JONG, G., and R. MOONEY. 1986. Explanation-based learning; an alternative view. Machine Learning, 1(2): 145-176.
9. DE RAEDT, L. and M. BRUYNOOGHE. 1988. On interactive concept-learning and assimilation. In Proceedings of the Third European Working Session on Learning (EWSL-88). Edited by D. Sleeman and J. Richmond. Pitman, London, pp. 167-176.
10. DE RAEDT, L. and M. BRUYNOOGHE. 1990. Indirect relevance and bias in inductive concept-learning. Knowledge Acquisition. 2:365-390.
11. FLANN, N. S. and T. G. DIETTERICH. 1989. A study of explanation-based methods for inductive learning. Machine Learning, 4(2): 187-226.
12. HUBERMAN, B. J. 1968. A program to play chess end games. CS-106, Computer Science Department, Stanford University, Stanford, CA.
13. KIETZ, J. U. and S. WROBEL. 1992. Controlling the complexity of learning in logic through syntactic task-oriented models. In Inductive logic programming. Edited by S. Muggleton. Academic Press, London, pp. 335-359.
14. LEVINSON, R. and R. SNYDER. 1991. Adaptive pattern-oriented chess. In Proceedings of the Ninth National Conference on Artificial Intelligence. AAAI Press, MIT Press, Cambridge, MA, pp. 601-606.
15. MINTON, S. 1984. Constraint-based generalization: learning game-playing plans from single examples. In Proceedings of the National Conference on Artificial Intelligence. Kaufmann, Menlo Park, CA, pp. 251-254.
16. MITCHELL, T. M., R. M. KELLER, and S. T. KEDAR-CABELLI. 1986. Explanation-based generalization: a unifying view. Machine Learning, 1(1):47-80.
17. MORALES, E. 1991. Learning features by experimentation in chess. In Proceedings of the European Working Session on Learning (EWSL-91). Edited by Y. Kodratoff. Springer-Verlag, Berlin, pp. 494-511.
18. MORALES, E. 1992. First-order induction of patterns in chess. Ph.D. thesis, Turing Institute, University of Strathciyde, Glasgow.
19. MORALES, E. 1994. Learning patterns for playing strategies. ICCA Journal, 17(1):15-26.
20. MORALES, E., and R. MORALES-MANZANARES. 1994. Learning counterpoint rules for analysis and generation. In Proceedings of the First Brasilian Symposium on Computer Music, (to appear).
21. MUGGLETON, S. 1991. Inductive logic programming. New Generation Computing 8:295-318.
22. MUGGLETON, S., and C. FENG. 1990. Efficient induction of logic programs. In Proceedings of First International Workshop on Algorithmic Learning Theory (ALT90). Edited by S. Arikaxa, S. Soto, S. Ohsuya, and T. Yokomari. Ohmsha, Tokyo, Japan, pp. 368-381.
23. NIBLETT, T. 1988. A study of generalisation in logic programs. In Proceedings of the Third European Working Session on Learning (EWSL-88). Edited by D. Sleeman and J. Richmond. Pitman, London, pp. 131-138.
24. PITRAT, J. 1977. A chess combination program which uses plans. Artificial Intelligence, 8:275-321.
25. PLOTKIN, G. D. 1969. A note on inductive generalisation. In Machine intelligence 5. Edited by B. Meltzer and D. Michie. Edinburgh University Press, Edinburgh, pp. 153-163.
26. PLOTKIN, G. D. 1971 a. A further note on inductive generalisation. In Machine intelligence 6. Edited by B. Meltzer and D. Michie. Edinburgh University Press, Edinburgh, pp. 101-124.
27. PLOTKIN, G. D. 1971b. Automatic methods of inductive inference. Ph.D. thesis, Edinburgh University, Edinburgh.
28. QUINLAN, J. R. 1983. Learning efficient classification procedures and their application to chess end games. In Machine learning: an artificial intelligence approach. Edited by R. S. Michalski, J. G. Carbonell, and T. M. Mitchell. Tioga, Palo Alto, CA, pp. 463-482.
29. QUINLAN, J. R. 1990. Learning logical definitions from relations. Machine Learning, 5(3):239-266.
30. ROUVEIROL, C. 1992. Extensions of inversion of resolution applied to theory completion. In Inductive logic programming. Edited by S. Muggleton. Academic Press, London, pp. 63-92.
31. SHAPIRO, A. D. 1987. Structured induction in expert systems. Turing Institute Press in association with Addison-Wesley, Wokingham, MA.
32. TADEPALLI, P. 1989. Planning in games using approximately learned macros. In Proceedings of the Sixth International Workshop on Machine Learning. Edited by B. Spatz. Morgan Kaufmann, San Mateo, CA, pp. 221-223.
33. WILKINS, D. 1979. Using patterns and plans to solve problems and control search. Technical Report MEMOAIM-329; STAN-CS-79-747. Stanford University, Artificial Intelligence Laboratory, Stanford, CA.