词条 | Game Description Language |
释义 |
Game Description Language, or GDL, is a logic programming language[1] designed by Michael Genesereth as part of the General Game Playing Project at Stanford University, California. GDL describes the state of a game as a series of facts, and the game mechanics as logical rules. Purpose of GDLQuoted in an article in New Scientist, Genesereth pointed out that although Deep Blue is able to play chess at a grandmaster level, it is incapable of playing checkers at all because it is a specialized game player.[2] Both chess and checkers can be described in GDL. This enables general game players to be built that can play both of these games and any other game that can be described using GDL. SpecificationSyntaxGDL is a variant of Datalog, and the syntax is largely the same. It is usually given in prefix notation. Variables begin with " KeywordsThe following is the list of keywords in GDL, along with brief descriptions of their functions:
This predicate is used to require that two terms be syntactically different.
The predicate
The predicate
This predicate refers to a true fact about the initial game state.
The predicate
This predicate refers to a true fact about the next game state.
This predicate is used to add the name of a player.
This predicate means that the current state is terminal.
This predicate refers to a true fact about the current game state. RulesA game description in GDL provides complete rules for each of the following elements of a game. PlayersFacts that define the roles in a game. The following example is from a GDL description of the two-player game Tic-tac-toe: (role xplayer)(role oplayer) Initial stateRules that entail all facts about the initial game state. An example is: (init (cell 1 1 blank))...(init (cell 3 3 blank))(init (control xplayer)) Legal movesRules that describe each move by the conditions on the current position under which it can be taken by a player. An example is: Game state updateRules that describe all facts about the next state relative to the current state and the moves taken by the players. An example is: TerminationRules that describe the conditions under which the current state is a terminal one. An example is: (<= terminal (line x))(<= terminal (line o))(<= terminal not boardopen) Goal statesThe goal values for each player in a terminal state. An example is: ExtensionWith GDL one can describe finite games with an arbitrary numbers of players. However, GDL can not describe games which contain an element of chance (for example, rolling of dice) or games where players have incomplete information about the current state of the game (for example, in many card games the opponents' cards are not visible). GDL-II, the Game Description Language for Incomplete Information games, extends GDL by two keywords that allow for the description of elements of chance and incomplete information:
The predicate
This constant refers to a pre-defined player who chooses moves randomly. The following is an example from a GDL-II description of the card game Texas hold 'em: See also
References1. ^{{cite web|url=http://games.stanford.edu/games/gdl.html|title=Game Definition Language|website=games.stanford.edu}} 2. ^{{Cite web|url=http://www.newscientisttech.com:80/channel/tech/mg19125626.100.html|title=Producing the ultimate game-playing bots - tech - 29 July 2006 - New Scientist Tech|last=Biever|first=Celeste|date=2006-07-29|website=|archive-url=https://web.archive.org/web/20070811111042/http://www.newscientisttech.com:80/channel/tech/mg19125626.100.html|archive-date=2007-08-11|dead-url=|access-date=}} External links
3 : Game artificial intelligence|Game theory|Logic programming languages |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。