On the Automatic Generation of Case Libraries by Chunking Chess Games
Citation:Flinter, Stephen; Keane, Mark T. 'On the Automatic Generation of Case Libraries by Chunking Chess Games'. - Dublin, Trinity College Dublin, Department of Computer Science, TCD-CS-95-16, 1995, pp10
TCD-CS-95-16.pdf (PDF) 142.9Kb
As a research topic computer game playing has contributed problems to AI that manifest exponential growth in the problem space. For the most part, in games such as chess and checkers these problems have been surmounted with enormous computing power on brute-force search methods using massive databases. It remains to be seen whether such techniques will extend to other games such as go and shogi. One suggestion is that these games and even chess might benefit from a knowledge-based treatment but such approaches have met with limited success. The problem, as ever from such approaches, is the characterisation of the knowledge to be used by the system. This paper deals with the Tal system, which employs case-based reasoning techniques for chess playing. In the paper, rather than focus on playing, we concentrate on the automatic generation of suitable case knowledge using a chunking technique on a corpus of grandmaster games.
Publisher:Trinity College Dublin, Department of Computer Science
Type of material:Technical Report
Series/Report no:Computer Science Technical Report
Availability:Full text available