Learning to Play Chess Selectively by Acquiring Move Patterns

Article type: Research Article

Authors: Finkelstein, L. | Markovitch, S.^{; 1}

Affiliations: Technion, Haifa, Israel

Note: [1] Computer Science Department, Technion, Haifa 32000, Israel. Email: {lev, shaulm}@cs.technion.ac.il.

Abstract: Human chess players do not perceive a position as a static entity, but as a collection of potential actions. Moreover, they seem to be able to follow promising moves without considering all the alternatives. This contribution investigates the possibility of incorporating such capabilities into chess programs. We describe a methodology and a language for representing move patterns. A move pattern is a structure consisting of a board pattern and a move that can be applied in that pattern. Move patterns are used for selecting promising branches of a search tree, hence allowing for a narrower and therefore deeper search tree. Move patterns are learned during training games and are stored in a hierarchical structure to enable fast retrieval. The paper describes algorithms for learning, storing, retrieving, and using the move patterns.

DOI: 10.3233/ICG-1998-21204

Journal: ICGA Journal, vol. 21, no. 2, pp. 100-119, 1998