|
Futile Game
In game theory, a ''futile game'' is a game that permits a draw or a tie when optimal moves are made by both players. An example of this type of game is the classical form of Tic-tac-toe, though not all variants are futile games. The term also does not apply to intransitive games, such as iterated prisoner's dilemma or rock–paper–scissors, in which there is no path to a draw or every strategy in the game can be beaten by another strategy. See also *Partisan game *Impartial game *Solved game A solved game is a game whose outcome (win, lose or draw) can be correctly predicted from any position, assuming that both players play perfectly. This concept is usually applied to abstract strategy games, and especially to games with full inform ... References Combinatorial game theory {{Game-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Game Theory
Game theory is the study of mathematical models of strategic interactions among rational agents. Myerson, Roger B. (1991). ''Game Theory: Analysis of Conflict,'' Harvard University Press, p.&nbs1 Chapter-preview links, ppvii–xi It has applications in all fields of social science, as well as in logic, systems science and computer science. Originally, it addressed two-person zero-sum games, in which each participant's gains or losses are exactly balanced by those of other participants. In the 21st century, game theory applies to a wide range of behavioral relations; it is now an umbrella term for the science of logical decision making in humans, animals, as well as computers. Modern game theory began with the idea of mixed-strategy equilibria in two-person zero-sum game and its proof by John von Neumann. Von Neumann's original proof used the Brouwer fixed-point theorem on continuous mappings into compact convex sets, which became a standard method in game theory and mathem ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Game
A game is a structured form of play, usually undertaken for entertainment or fun, and sometimes used as an educational tool. Many games are also considered to be work (such as professional players of spectator sports or games) or art (such as jigsaw puzzles or games involving an artistic layout such as Mahjong, solitaire, or some video games). Games are sometimes played purely for enjoyment, sometimes for achievement or reward as well. They can be played alone, in teams, or online; by amateurs or by professionals. The players may have an audience of non-players, such as when people are entertained by watching a chess championship. On the other hand, players in a game may constitute their own audience as they take their turn to play. Often, part of the entertainment for children playing a game is deciding who is part of their audience and who is a player. A toy and a game are not the same. Toys generally allow for unrestricted play whereas games come with present rules. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tic-tac-toe
Tic-tac-toe (American English), noughts and crosses (Commonwealth English), or Xs and Os (Canadian or Irish English) is a paper-and-pencil game for two players who take turns marking the spaces in a three-by-three grid with ''X'' or ''O''. The player who succeeds in placing three of their marks in a horizontal, vertical, or diagonal row is the winner. It is a solved game, with a forced draw assuming best play from both players. Gameplay Tic-tac-toe is played on a three-by-three grid by two players, who alternately place the marks X and O in one of the nine spaces in the grid. In the following example, the first player (''X'') wins the game in seven steps: There is no universally-agreed rule as to who plays first, but in this article the convention that X plays first is used. Players soon discover that the best play from both parties leads to a draw. Hence, tic-tac-toe is often played by young children who may not have discovered the optimal strategy. Because of t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tic-tac-toe Variants
Tic-tac-toe is an instance of an m,n,k-game, where two players alternate taking turns on an ''m''×''n'' board until one of them gets ''k'' in a row. Harary's generalized tic-tac-toe is an even broader generalization. The game can also be generalized as a nd game. The game can be generalised even further from the above variants by playing on an arbitrary hypergraph where rows are hyperedges and cells are vertices. Many board games share the element of trying to be the first to get ''n''-in-a-row, including three men's morris, nine men's morris, pente, gomoku, Qubic, Connect Four, Quarto, Gobblet, Order and Chaos, Toss Across, and Mojo. Variants of tic-tac-toe date back several millennia. Historic An early variation of tic-tac-toe was played in the Roman Empire, around the first century BC. It was called Terni Lapilli and instead of having any number of pieces, each player only had three; thus, they had to move them around to empty spaces to keep playing. The game's grid ma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nontransitive Game
In game theory, an intransitive or non-transitive game is the one in which the various strategies produce one or more "loops" of preferences. In a non- transitive game in which strategy A is preferred over strategy B, and strategy B is preferred over strategy C, strategy A is ''not'' necessarily preferred over strategy C. A prototypical example non-transitive game is the game rock, paper, scissors which is explicitly constructed as a non-transitive game. In probabilistic games like Penney's game, the violation of transitivity results in a more subtle way, and is often presented as a probability paradox. Examples * Rock, paper, scissors * Penney's game * Intransitive dice * Street Fighter , commonly abbreviated as ''SF'' or スト (''Suto''), is a Japanese media franchise centered on a series of fighting video and arcade games developed and published by Capcom. The first game in the series was released in 1987, followed by six .... The videogame franchise that introduc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Iterated Prisoner's Dilemma
The Prisoner's Dilemma is an example of a game analyzed in game theory. It is also a thought experiment that challenges two completely rational agents to a dilemma: cooperate with their partner for mutual reward, or betray their partner ("defect") for individual reward. This dilemma was originally framed by Merrill Flood and Melvin Dresher while working at RAND in 1950. Albert W. Tucker appropriated the game and formalized it by structuring the rewards in terms of prison sentences and named it "prisoner's dilemma". William Poundstone in his 1993 book ''Prisoner's Dilemma'' writes the following version:Two members of a criminal gang are arrested and imprisoned. Each prisoner is in solitary confinement with no means of speaking to or exchanging messages with the other. The police admit they don't have enough evidence to convict the pair on the principal charge. They plan to sentence both to two years in prison on a lesser charge. Simultaneously, the police offer each prisone ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rock–paper–scissors
Rock paper scissors (also known by other orderings of the three items, with "rock" sometimes being called "stone," or as Rochambeau, roshambo, or ro-sham-bo) is a hand game originating in China, usually played between two people, in which each player simultaneously forms one of three shapes with an outstretched hand. These shapes are "rock" (a closed fist), "paper" (a flat hand), and "scissors" (a fist with the index finger and middle finger extended, forming a V). "Scissors" is identical to the two-fingered V sign (also indicating "victory" or "peace") except that it is pointed horizontally instead of being held upright in the air. A simultaneous, zero-sum game, it has three possible outcomes: a draw, a win or a loss. A player who decides to play rock will beat another player who has chosen scissors ("rock crushes scissors" or "breaks scissors" or sometimes "blunts scissors"), but will lose to one who has played paper ("paper covers rock"); a play of paper will lose to a play o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Partisan Game
In combinatorial game theory, a game is partisan (sometimes partizan) if it is not impartial. That is, some moves are available to one player and not to the other. Most games are partisan. For example, in chess, only one player can move the white pieces. More strongly, when analyzed using combinatorial game theory, many chess positions have values that cannot be expressed as the value of an impartial game, for instance when one side has a number of extra tempos that can be used to put the other side into zugzwang. Partisan games are more difficult to analyze than impartial game In combinatorial game theory, an impartial game is a game in which the allowable moves depend only on the position and not on which of the two players is currently moving, and where the payoffs are symmetric. In other words, the only difference betw ...s, as the Sprague–Grundy theorem does not apply. However, the application of combinatorial game theory to partisan games allows the significance of ''numb ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Impartial Game
In combinatorial game theory, an impartial game is a game in which the allowable moves depend only on the position and not on which of the two players is currently moving, and where the payoffs are symmetric. In other words, the only difference between player 1 and player 2 is that player 1 goes first. The game is played until a terminal position is reached. A terminal position is one from which no moves are possible. Then one of the players is declared the winner and the other the loser. Furthermore, impartial games are played with perfect information and no chance moves, meaning all information about the game and operations for both players are visible to both players. Impartial games include Nim, Sprouts, Kayles, Quarto, Cram, Chomp, Subtract a square, Notakto, and poset games. Go and chess are not impartial, as each player can only place or move pieces of their own color. Games such as poker, dice Dice (singular die or dice) are small, throwable objects with marked si ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Solved Game
A solved game is a game whose outcome (win, lose or draw) can be correctly predicted from any position, assuming that both players play perfectly. This concept is usually applied to abstract strategy games, and especially to games with full information and no element of chance; solving such a game may use combinatorial game theory and/or computer assistance. Overview A two-player game can be solved on several levels: ;Ultra-weak : Prove whether the first player will win, lose or draw from the initial position, given perfect play on both sides. This can be a non-constructive proof (possibly involving a strategy-stealing argument) that need not actually determine any moves of the perfect play. ;Weak : Provide an algorithm that secures a win for one player, or a draw for either, against any possible moves by the opponent, from the beginning of the game. ;Strong : Provide an algorithm that can produce perfect moves from any position, even if mistakes have already been made on on ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Game")
%2C_Japanese_rock-paper-scissors_variant%2C_from_the_Kensarae_sumai_zue_(1809).jpg "Click for more on -> Rock–paper–scissors")
