General Game Playing Task

Context:
- It can be solved by a General Game Playing System (by implementing a General Game Playing Algorithm).
Example(s):
- a Stanford General Game Playing Task, such as: ...
- …
Counter-Example(s):
- Specialized Game Playing Task, such as Chess, Go Game, ...
See: Deep Blue, Alpha Go Zero.

References

(Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/general_game_playing Retrieved:2017-9-17.
- General game playing (GGP) is the design of artificial intelligence programs to be able to play more than one game successfully. General Game Playing: Overview of the AAAI Competition by Michael Genesereth, Nathaniel Love and Barney Pell. </ref> For many games like chess, computers are programmed to play these games using a specially designed algorithm, which cannot be transferred to another context. For example, a chess-playing computer program cannot play checkers. A general game playing system, if well designed, would be able to help in other areas, such as in providing intelligence for search and rescue missions.

(Genesereth & Thielscher, 2014) ⇒ Michael Genesereth, and Michael Thielscher. (2014). “General Game Playing.” In: Synthesis Lectures on Artificial Intelligence and Machine Learning Journal, March 2014.In: Synthesis Lectures on Artificial Intelligence and Machine Learning Journal, March 2014. doi:10.2200/S00564ED1V01Y201311AIM02
- QUOTE: General game players are computer systems able to play strategy games based solely on formal game descriptions supplied at “runtime” (in other words, they don't know the rules until the game starts). Unlike specialized game players, such as Deep Blue, general game players cannot rely on algorithms designed in advance for specific games; they must discover such algorithms themselves. General game playing expertise depends on intelligence on the part of the game player and not just intelligence of the programmer of the game player.