Automatic Heuristic Construction for General Game Playing
Lists
Only you see this
Abstract
Introduction Creating programs that can play games such as chess, checkers, and backgammon, at a high level has long been a challenge and benchmark for AI. While several game-playing systems developed in the past, such as Deep Blue (Campbell, Jr., & Hsu 2002), Chinook (Schaeffer et al. 1992), and TD-gammon (Tesauro 1994) have demonstrated competitive play against human players, such systems are limited in that they play only one particular game and they must be supplied with large amounts of expert knowledge. While their performance is impressive, it could be argued that the demonstrated intelligence is that of the system’s designers more so than that of the system itself. General Game Playing is the more challenging problem of designing an agent capable of playing many different previously unseen games (Pell 1993). The first AAAI General Game Playing Competition was held at 2005 AAAI meeting in Pittsburgh in order to promote research in this area (Genesereth & Love 2005). We were one of nine participants in that competition. We survey some of the issues involved in creating a general game playing system and introduce our entry to that event. The main feature of our approach is a novel method for automatically constructing effective search heuristics based on the formal game description. Our agent is fully implemented and tested in a range of different games.
BibTeX
@inproceedings{kuhlmann2006automatic,
author = {Gregory Kuhlmann and Peter Stone},
title = {{Automatic Heuristic Construction for General Game Playing}},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2006},
}Loading related content...