Game Description Language, or GDL, is a logic programming language 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. GDL is hereby one of alternative representations for game theoretic problems. Quoted 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. 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.
Read all..
This is a video about (170705) 주간 아이돌 310회 블랙핑크 (BLACKPINK) - Weekly idol ep 310 BLACKPINK
主要支援：已於2009年4月8日到期 延伸支援：已於2014年4月8日到期（仅限Service Pack 3 x86（SP3 x86）及Service Pack 2 x64（SP2 x64）） 新增的功能 移除的功能 版本 开发历史 批評 主题 Windows XP（开发代号：）是微软公司推出供个人电脑使用的操作系统，包括商用及家用的桌上型电脑、笔记本电脑、媒体中心（英语：）和平板电脑等。其RTM版于2001年8月24日发布；零售版于2001年10月25日上市。其名字「」的意思是英文中的「体验」（）。Windows ..
Nov 13, 2019- Explore dobdan222's board "교복", followed by 405 people on Pinterest. See more ideas about Asian girl, Korean student and Fashion.
Nov 10, 2019- Explore cutebear36088's board "여고딩", followed by 557 people on Pinterest. See more ideas about School looks, Fashion and School uniform.
Republika obeh narodov Habsburška monarhija Bavarska Saška Franconia Švabska Zaporoški kozaki Velika vojvodina Toskana Drugo obleganje Dunaja je potekalo leta 1683; pričelo se je 14. julija 1683, ko je Osmanski imperij obkolil Dunaj in končalo 11. septembra ..
Robert Henry Goldsborough (January 4, 1779 – October 5, 1836) was an American politician from Talbot County, Maryland. Goldsborough was born at "Myrtle Grove" near Easton, Maryland. He was educated by private tutors and graduated from St. John's College in ..
Anabolic steroids, also known more properly as anabolic–androgenic steroids (AAS), are steroidal androgens that include natural androgens like testosterone as well as synthetic androgens that are structurally related and have similar effects to testosterone. ..
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. GDL is hereby one of alternative representations for game theoretic problems.[2]
Quoted 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.[3] 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.
GDL is a variant of Datalog, and the syntax is largely the same. It is usually given in prefix notation. Variables begin with "?".[4]
The following is the list of keywords in GDL, along with brief descriptions of their functions:
distinctdoesdoes(?r,?m) means that player (or role) ?r makes move ?m in the current game state.goalgoal(?r,?n) is used to define goal value ?n (usually a natural number between 0 and 100) for role ?r in the current state.initlegallegal(?r,?m) means that ?m is a legal move for role ?r in the current state.nextroleterminaltrueA game description in GDL provides complete rules for each of the following elements of a game.
Facts 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)
Rules 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))
Rules that describe each move by the conditions on the current position under which it can be taken by a player. An example is:
(<= (legal ?player (mark ?m ?n))
(true (cell ?m ?n blank))
(true (control ?player)))
Rules that describe all facts about the next state relative to the current state and the moves taken by the players. An example is:
(<= (next (cell ?m ?n x))
(does xplayer (mark ?m ?n)))
(<= (next (cell ?m ?n o))
(does oplayer (mark ?m ?n)))
Rules 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)
The goal values for each player in a terminal state. An example is:
(<= (goal xplayer 100)
(line x))
(<= (goal oplayer 0)
(line x))
With GDL, one can describe finite games with an arbitrary numbers of players. However, GDL cannot describe games which contain an element of chance (for example, rolling 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:[5]
seessees(?r,?p) means that role ?r perceives ?p in the next game state.randomThe following is an example from a GDL-II description of the card game Texas hold 'em:
(<= (sees ?player ?card)
(does random (deal_face_down ?player ?card)))
(<= (sees ?r ?card)
(role ?r)
(does random (deal_river ?card)))
Michael Thielscher also created a further extension, GDL-III, a general game description language with imperfect information and introspection, that supports the specification of epistemic games — ones characterised by rules that depend on the knowledge of players.[6]
In classical game theory, games can be formalised in extensive and normal forms. For cooperative game theory, games are represented using characteristic functions. Some subclasses of games allow special representations in smaller sizes also known as succinct games. Some of the newer developments of formalisms and languages for representation of some subclasses of games or representations adjusted to the needs of interdisciplinary research are summarized as the following table.[7] Some of these alternative representations also encode time related aspects:
| Name | Year | Means | Type of games | Time |
|---|---|---|---|---|
| Congestion game[8] | 1973 | functions | subset of n-person games, simultaneous moves | No |
| Sequential form[9] | 1994 | matrices | 2-person games of imperfect information | No |
| Timed games[10][11] | 1994 | functions | 2-person games | Yes |
| Gala[12] | 1997 | logic | n-person games of imperfect information | No |
| Local effect games[13] | 2003 | functions | subset of n-person games, simultaneous moves | No |
| Game Petri-nets[14] | 2006 | Petri net | deterministic n-person games, simultaneous moves | No |
| Continuous games[15] | 2007 | functions | subset of 2-person games of imperfect information | Yes |
| PNSI[16][17] | 2008 | Petri net | n-person games of imperfect information | Yes |
| Action graph games[18] | 2012 | graphs, functions | n-person games, simultaneous moves | No |
| Graphical games[19] | 2015 | graphs, functions | n-person games, simultaneous moves | No |
![[icon]](https://en.wikipedia.org/wiki/File:Wiki_letter_w_cropped.svg){kind=small} | This section needs expansion. You can help by adding to it. (July 2019) |
A 2016 paper "describes a multilevel algorithm compiling a general game description in GDL into an optimized reasoner in a low level language".[20]
A 2017 paper uses GDL to model the process of mediating a resolution to a dispute between two parties, and presented an algorithm that uses available information efficiently to do so.[21]
|volume= has extra text (help)