A STRATEGIC METAGAME PLAYER FOR GENERAL CHESS‐LIKE GAMES
作者:
Barney Pell,
期刊:
Computational Intelligence
(WILEY Available online 1996)
卷期:
Volume 12,
issue 1
页码: 177-198
ISSN:0824-7935
年代: 1996
DOI:10.1111/j.1467-8640.1996.tb00258.x
出版商: Blackwell Publishing Ltd
关键词: games;metagame;heuristic search;evaluation‐function learning;strategy;rule analysis;chess;knowledge representation;methodology;game generation
数据来源: WILEY
摘要:
This paper introduces METAGAMER, the first program designed within the paradigm of Metagame‐playing (Metagame). This program plays games in the class of symmetric chess‐like games, which includes chess, Chinese chess, checkers, draughts, and Shogi. METAGAMER takes as input therulesof a specific game and analyzes those rules to construct an efficient representation and an evaluation function for that game; they are used by a generic search engine. The strategic analysis performed by METAGAMER relates a set of general knowledge sources to the details of the particular game. Among other properties, this analysis determines the relative value of the different pieces in a given game. Although METAGAMER does not learn from experience, the values resulting from its analysis are qualitatively similar to values used by experts on known games and are sufficient to produce competitive performance the first time METAGAMER plays a new game. Besides being the first Metagame‐playing program, this is the first program to have derived useful piece values directly from analysis of the rules of different games. This paper describes the knowledge implemented in METAGAMER, illustrates the piece values METAGAMER derives for chess and checkers, and discusses experiments with METAGAMER on both existing and newly generated
点击下载:
PDF
(1737KB)
返 回