Zero-player game: Difference between revisions
No edit summary |
Clarity, spelling, grammer. |
||
| Line 12: | Line 12: | ||
| author = Ljiljana Petruševski, Mirjana Devetaković, Bojan Mitrović |
| author = Ljiljana Petruševski, Mirjana Devetaković, Bojan Mitrović |
||
| url = http://elearning.amres.ac.rs/journals/index.php/spatium/article/viewFile/7/6 |
| url = http://elearning.amres.ac.rs/journals/index.php/spatium/article/viewFile/7/6 |
||
}}</ref> In addition, |
}}</ref> In addition, some [[Fighting game|fighting]] and [[real-time strategy]] games can be put into zero-player mode by placing one [[Artificial intelligence|AI]] against another. |
||
==Categories== |
==Categories== |
||
| Line 18: | Line 18: | ||
===Setup-only games=== |
===Setup-only games=== |
||
The evolution of this kind of game is determined by its initial state, requiring no further input. [[Conway's Game of Life]] is a setup-only game. Programming games are a subgroup of setup-only games where people create AI players that compete against each other in the actual games. |
|||
===Games played by AI=== |
===Games played by AI=== |
||
In |
In these games, the role of the player is taken by a computer. In single-player games, humans can play against computers; in zero-player games, computers play against other computers. |
||
===Solved games=== |
===Solved games=== |
||
In [[Nim]] |
In games such as [[Nim]], we can pre-determine which player will win if both plays perfectly. The game is only about examining the board, so the need for players is eliminated. In checkers perfect play always leads to draw.<ref name=checkers>[http://www.scientificamerican.com/article.cfm?id=computers-solve-checkers-its-a-draw Computers Solve Checkers—It's a Draw]</ref> |
||
===Hypothetical games=== |
===Hypothetical games=== |
||
Revision as of 16:42, 15 July 2013
A zero-player game is a game that has no sentient players.
In computer games, the term refers to programs that use artificial intelligence rather than human players.[1]
Conway's Game of Life, a cellular automaton devised in 1970 by the British mathematician John Horton Conway, is considered a zero-player game because its evolution is determined by its initial state, requiring no further input from humans.[2][3] In addition, some fighting and real-time strategy games can be put into zero-player mode by placing one AI against another.
Categories
Zero player games can be divided in several categories:[4]
Setup-only games
The evolution of this kind of game is determined by its initial state, requiring no further input. Conway's Game of Life is a setup-only game. Programming games are a subgroup of setup-only games where people create AI players that compete against each other in the actual games.
Games played by AI
In these games, the role of the player is taken by a computer. In single-player games, humans can play against computers; in zero-player games, computers play against other computers.
Solved games
In games such as Nim, we can pre-determine which player will win if both plays perfectly. The game is only about examining the board, so the need for players is eliminated. In checkers perfect play always leads to draw.[5]
Hypothetical games
Proposed but non-implemented games described to examine a question, or actually existing games that are for practical purposes unplayable.
See also
References
- ^ "Encyclopedia of Play in Today's Society", Rodney P. Carlisle, SAGE Publications.
- ^ Martin Gardner (October 1970), "Mathematical games: The fantastic combinations of John Conway's new solitaire game 'Life'" (PDF), Scientific American
- ^ Ljiljana Petruševski, Mirjana Devetaković, Bojan Mitrović, Self-Replicating Systems in Spatial Form Generation - The Concept of Cellular Automata
{{citation}}: CS1 maint: multiple names: authors list (link) - ^ Zero-Player Games
- ^ Computers Solve Checkers—It's a Draw
 | This game-related article is a stub. You can help Wikipedia by expanding it. |