Learning Playing Strategies In Chess (1996)
BibTeX
@MISC{M.96learningplaying,
author = {Eduardo Morales M.},
title = {Learning Playing Strategies In Chess},
year = {1996}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
this paper, a first--order system, called PAL, that can learn patterns in the form of Horn clauses from simple example descriptions and general purpose knowledge is described. It is shown how PAL can learn chess patterns which are beyond the learning capabilities of current inductive systems. The patterns learned by PAL can be used for analysis of positions and for the construction of playing strategies. By taking the learned patterns as attributes for describing examples, a set of rules which decide whether a Pawn can safely be promoted without moving the King in a King and Pawn vs. King endgame, is automatically constructed with a similarity-based learning algorithm. Similarly, a playing strategy for the King and Rook vs. King endgame is automatically constructed with a simple learning algorithm, by following traces of games and using the patterns learned by PAL. Limitations of PAL in particular, and first--order systems in general, are exposed in domains where a large number of background definitions may be required for induction. Conclusions and future research directions are given. 1. INTRODUCTION
Keyphrases
king endgame first order system playing strategy pawn v general purpose knowledge simple example description current inductive system background definition simple learning algorithm rook v chess pattern large number future research direction horn clause similarity-based learning algorithm learning capability
