Tic-tac-toe

Paper-and-pencil game for two players

"Tic Tac Toe" and "Noughts and Crosses" redirect here. For other uses, see Tic Tac Toe (disambiguation) and Noughts and Crosses (disambiguation).

Tic-tac-toe

A completed game of tic-tac-toe

Other names|

* Noughts and Crosses
* Xs and Os

Genres| Paper-and-pencil game
Players| 2
Setup time| Minimal
Playing time| ~1 minute
Chance| None
Skills| Strategy, tactics, observation

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 first is the winner. It is a solved game, with a forced draw assuming best play from both players.

## Names

[edit]

In American English, the game is known as "tic-tac-toe". It may also be spelled "tick-tack-toe", "tick-tat-toe", or "tit-tat-toe".[1][2]

In Commonwealth English (particularly British, South African, Indian, Australian, and New Zealand English), the game is known as "noughts and crosses", alternatively spelled "naughts and crosses". This name derives from the shape of the marks in the game (i.e the X and O); "nought" is another name for the number zero, while "cross" refers to the X shape.

Sometimes, tic-tac-toe (where players keep adding "pieces") and three men's morris (where pieces start to move after a certain number have been placed) are confused with each other.

## Gameplay

[edit]

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:

Game of Tic-tac-toe, won by X

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 the simplicity of tic-tac-toe, it is often used as a pedagogical tool for teaching the concepts of good sportsmanship and the branch of artificial intelligence that deals with the searching of game trees. It is straightforward to write a computer program to play tic-tac-toe perfectly or to enumerate the 765 essentially different positions (the state space complexity) or the 26,830 possible games up to rotations and reflections (the game tree complexity) on this space.[3] If played optimally by both players, the game always ends in a draw, making tic-tac-toe a futile game.[4]

Incidence structure for tic-tac-toe

The game can be generalized to an m,n,k-game, in which two players alternate placing stones of their own color on an m-by-n board with the goal of getting k of their own color in a row. Tic-tac-toe is the 3,3,3-game.[5] Harary's generalized tic-tac-toe is an even broader generalization of tic-tac-toe. It can also be generalized as an nd game, specifically one in which n = 3 and d = 2.[6] It can be generalised even further by playing on an arbitrary incidence structure, where rows are lines and cells are points. Tic-tac-toe's incidence structure consists of nine points, three horizontal lines, three vertical lines, and two diagonal lines, with each line consisting of at least three points.

## History

[edit]

Games played on three-in-a-row boards can be traced back to ancient Egypt,[7] where such game boards have been found on roofing tiles dating from around 1300 BC.[8]

An early variation of tic-tac-toe was played in the Roman Empire, around the first century BC. It was called terni lapilli (three pebbles at a time) and instead of having any number of pieces, each player had only three; thus, they had to move them around to empty spaces to keep playing.[9] The game's grid markings have been found chalked all over Rome. Another closely related ancient game is three men's morris which is also played on a simple grid and requires three pieces in a row to finish,[10] and Picaria, a game of the Puebloans.

The different names of the game are more recent. The first print reference to "noughts and crosses" (nought being an alternative word for 'zero'), the British name, appeared in 1858, in an issue of Notes and Queries.[11] The first print reference to a game called "tick-tack-toe" occurred in 1884, but referred to "a children's game played on a slate, consisting of trying with the eyes shut to bring the pencil down on one of the numbers of a set, the number hit being scored".[This quote needs a citation] "Tic-tac-toe" may also derive from "tick-tack", the name of an old version of backgammon first described in 1558. The US renaming of "noughts and crosses" to "tic-tac-toe" occurred in the 20th century.[12]

In 1952, OXO (or Noughts and Crosses), developed by British computer scientist Sandy Douglas for the EDSAC computer at the University of Cambridge, became one of the first known video games.[13][14] The computer player could play perfect games of tic-tac-toe against a human opponent.[13]

In 1975, tic-tac-toe was also used by MIT students to demonstrate the computational power of Tinkertoy elements. The Tinkertoy computer, made out of (almost) only Tinkertoys, is able to play tic-tac-toe perfectly.[15] It is currently on display at the Computer History Museum.[16]

## Combinatorics

[edit]

When considering only the state of the board, and after taking into account board symmetries (i.e. rotations and reflections), there are only 138 terminal board positions. A combinatorics study of the game shows that when "X" makes the first move every time, the game outcomes are as follows:[17]

* 91 distinct positions are won by (X)
* 44 distinct positions are won by (O)
* 3 distinct positions are drawn (often called a "cat's game"[18])

## Strategy

[edit]

Optimal strategy for player X if starting in upper left. In each grid, the shaded red X denotes the optimal move, and the location of O's next move gives the next subgrid to examine. Only two sequences of moves by O (both starting with the center, top-right, left-mid) lead to a draw, with the remaining sequences leading to wins from X. Optimal strategy for player O. Player O can only force a win or draw by playing in the center first.

A player can play a perfect game of tic-tac-toe (to win or at least draw) if, each time it is their turn to play, they choose the first available move from the following list, as used in Newell and Simon's 1972 tic-tac-toe program.[19]

1. Win: If the player has two in a row, they can place a third to get three in a row.
2. Block: If the opponent has two in a row, the player must play the third themselves to block the opponent.
3. Fork: Cause a scenario where the player has two ways to win (two non-blocked lines of 2).
4. Blocking an opponent's fork: If there is only one possible fork for the opponent, the player should block it. Otherwise, the player should block all forks in any way that simultaneously allows them to make two in a row. Otherwise, the player should make a two in a row to force the opponent into defending, as long as it does not result in them producing a fork. For example, if "X" has two opposite corners and "O" has the center, "O" must not play a corner move to win. (Playing a corner move in this scenario produces a fork for "X" to win.)
5. Center: A player marks the center. (If it is the first move of the game, playing a corner move gives the second player more opportunities to make a mistake and may therefore be the better choice; however, it makes no difference between perfect players.)
6. Opposite corner: If the opponent is in the corner, the player plays the opposite corner.
7. Empty corner: The player plays in a corner square.
8. Empty side: The player plays in a middle square on any of the four sides.

The first player, who shall be designated "X", has three possible strategically distinct positions to mark during the first turn. Superficially, it might seem that there are nine possible positions, corresponding to the nine squares in the grid. However, by rotating the board, we will find that, in the first turn, every corner mark is strategically equivalent to every other corner mark. The same is true of every edge (side middle) mark. From a strategic point of view, there are therefore only three possible first marks: corner, edge, or center. Player X can win or force a draw from any of these starting marks; however, playing the corner gives the opponent the smallest choice of squares which must be played to avoid losing.[20] This might suggest that the corner is the best opening move for X, however another study[21] shows that if the players are not perfect, an opening move in the center is best for X.

The second player, who shall be designated "O", must respond to X's opening mark in such a way as to avoid the forced win. Player O must always respond to a corner opening with a center mark, and to a center opening with a corner mark. An edge opening must be answered either with a center mark, a corner mark next to the X, or an edge mark opposite the X. Any other responses will allow X to force the win. Once the opening is completed, O's task is to follow the above list of priorities in order to force the draw, or else to gain a win if X makes a weak play.

More detailed, to guarantee a draw, O should adopt the following strategies:

* If X plays a corner opening move, O should take center, and then an edge, forcing X to block in the next move. This will stop any forks from happening. When both X and O are perfect players and X chooses to start by marking a corner, O takes the center, and X takes the corner opposite the original. In that case, O is free to choose any edge as its second move. However, if X is not a perfect player and has played a corner and then an edge, O should not play the opposite edge as its second move, because then X is not forced to block in the next move and can fork.
* If X plays edge opening move, O should take center or one of the corners adjacent to X, and then follow the above list of priorities, mainly paying attention to block forks. With perfect play, O can also force a draw by taking the opposite edge from X.
* If X plays the center opening move, O should take a corner, and then follow the above list of priorities, mainly paying attention to block forks.

When X plays corner first, and O is not a perfect player, the following may happen:

* If O responds with a center mark (best move for them), a perfect X player will take the corner opposite the original. Then O should play an edge. However, if O plays a corner as its second move, a perfect X player will mark the remaining corner, blocking O's 3-in-a-row and making their own fork.
* If O responds with a corner mark, X is guaranteed to win. By taking any of the other two corners, O can only take the position between the two Xs, then by taking the remaining corner to create a fork, X will win on the next move.
* If O responds with an edge mark, X is guaranteed to win. By taking center, O can only take the corner opposite the corner which X plays first, then by taking a corner to create a fork, X will win on the next move.

### Further details

[edit]

Consider a board with the nine positions numbered as follows:

1 |  2 |  3

|
|

4 |  5 |  6
7 |  8 |  9

When X plays 1 as their opening move, then O should take 5. Then X takes 9 (in this situation, O should not take 3 or 7, O should take 2, 4, 6 or 8):

* X1 → O5 → X9 → O2 → X8 → O7 → X3 → O6 → X4, this game will be a draw.

or 6 (in this situation, O should not take 4 or 7, O should take 2, 3, 8 or 9. In fact, taking 9 is the best move, since a non-perfect player X may take 4, then O can take 7 to win).

* X1 → O5 → X6 → O2 → X8, then O should not take 3, or X can take 7 to win, and O should not take 4, or X can take 9 to win, O should take 7 or 9.
* X1 → O5 → X6 → O2 → X8 → O7 → X3 → O9 → X4, this game will be a draw.
* X1 → O5 → X6 → O2 → X8 → O9 → X4 (7) → O7 (4) → X3, this game will be a draw.
* X1 → O5 → X6 → O3 → X7 → O4 → X8 (9) → O9 (8) → X2, this game will be a draw.
* X1 → O5 → X6 → O8 → X2 → O3 → X7 → O4 → X9, this game will be a draw.
* X1 → O5 → X6 → O9, then X should not take 4, or O can take 7 to win, X should take 2, 3, 7 or 8.
* X1 → O5 → X6 → O9 → X2 → O3 → X7 → O4 → X8, this game will be a draw.
* X1 → O5 → X6 → O9 → X3 → O2 → X8 → O4 (7) → X7 (4), this game will be a draw.
* X1 → O5 → X6 → O9 → X7 → O4 → X2 (3) → O3 (2) → X8, this game will be a draw.
* X1 → O5 → X6 → O9 → X8 → O2 (3, 4, 7) → X4/7 (4/7, 2/3, 2/3) → O7/4 (7/4, 3/2, 3/2) → X3 (2, 7, 4), this game will be a draw.

In both of these situations (X takes 9 or 6 as the second move), X has a ⁠1/3⁠ property to win.

If X is not a perfect player, X may take 2 or 3 as a second move. Then this game will be a draw, X cannot win.

* X1 → O5 → X2 → O3 → X7 → O4 → X6 → O8 (9) → X9 (8), this game will be a draw.
* X1 → O5 → X3 → O2 → X8 → O4 (6) → X6 (4) → O9 (7) → X7 (9), this game will be a draw.

If X plays 1 opening move, and O is not a perfect player, the following may happen:

Although O takes the only good position (5) as the first move, O takes a bad position as the second move:

* X1 → O5 → X9 → O3 → X7, then X can take 4 or 8 to win.
* X1 → O5 → X6 → O4 → X3, then X can take 7 or 9 to win.
* X1 → O5 → X6 → O7 → X3, then X can take 2 or 9 to win.

Although O takes good positions in the first two moves, O takes a bad position in the third move:

* X1 → O5 → X6 → O2 → X8 → O3 → X7, then X can take 4 or 9 to win.
* X1 → O5 → X6 → O2 → X8 → O4 → X9, then X can take 3 or 7 to win.

O takes a bad position as first move (except of 5, all other positions are bad):

* X1 → O3 → X7 → O4 → X9, then X can take 5 or 8 to win.
* X1 → O9 → X3 → O2 → X7, then X can take 4 or 5 to win.
* X1 → O2 → X5 → O9 → X7, then X can take 3 or 4 to win.
* X1 → O6 → X5 → O9 → X3, then X can take 2 or 7 to win.

## Variations

[edit]

Main article: Tic-tac-toe variants

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. 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 be generalised even further by playing on an arbitrary hypergraph, where rows are hyperedges and cells are vertices.

Other variations of tic-tac-toe include:

* 3-dimensional tic-tac-toe on a 3×3×3 board. In this game, the first player has an easy win by playing in the centre if 2 people are playing.

One can play on a board of 4x4 squares, winning in several ways. Winning can include: 4 in a straight line, 4 in a diagonal line, 4 in a diamond, or 4 to make a square.

Another variant, Qubic, is played on a 4×4×4 board; it was solved by Oren Patashnik in 1980 (the first player can force a win).[22] Higher dimensional variations are also possible.[6]

* In misère tic-tac-toe, the player wins if the opponent gets n in a row.[23] A 3×3 game is a draw. More generally, the first player can draw or win on any board (of any dimension) whose side length is odd, by playing first in the central cell and then mirroring the opponent's moves.[6]

* In "wild" tic-tac-toe, players can choose to place either X or O on each move.[24][25][26]
* Number Scrabble or Pick15[27] is isomorphic to tic-tac-toe but on the surface appears completely different.[28] Two players in turn say a number between one and nine. A particular number may not be repeated. The game is won by the player who has said three numbers whose sum is 15.[27][29] If all the numbers are used and no one gets three numbers that add up to 15 then the game is a draw.[27] Plotting these numbers on a 3×3 magic square shows that the game exactly corresponds with tic-tac-toe, since three numbers will be arranged in a straight line if and only if they total 15.[30]

| fear | or | try | → r

|
|
|
|

be | boat | by | → b
ten | on | any | → n

| ↓

| ↓

| ↓

| ↘

* Another isomorphic game uses a list of nine carefully chosen words, for instance "try", "be", "on", "any", "boat", "by", "ten", "or", and "fear". Each player picks one word in turn and to win, a player must select three words with the same letter. The words may be plotted on a tic-tac-toe grid in such a way that a three-in-a-row line wins.[31]
* Numerical tic-tac-toe is a variation invented by the mathematician Ronald Graham. The numbers 1 to 9 are used in this game. The first player plays with the odd numbers, and the second player plays with the even numbers. All numbers can be used only once. The player who puts down 15 points in a line wins (sum of 3 numbers).
* In the 1970s, there was a two-player game made by Tri-ang Toys & Games called Check Lines, in which the board consisted of eleven holes arranged in a geometrical pattern of twelve straight lines each containing three of the holes. Each player had exactly five tokens and played in turn placing one token in any of the holes. The winner was the first player whose tokens were arranged in two lines of three (which by definition were intersecting lines). If neither player had won by the tenth turn, subsequent turns consisted of moving one of one's own tokens to the remaining empty hole, with the constraint that this move could only be from an adjacent hole.[32]
* There is also a variant of the game with the classic 3×3 field, in which it is necessary to make two rows to win, while the opposing algorithm only needs one.[33]
* Quantum tic-tac-toe allows players to place a quantum superposition of numbers on the board, i.e. the players' moves are "superpositions" of plays in the original classical game. This variation was invented by Allan Goff of Novatia Labs.[34]

## In popular culture

[edit]

* George Cooper wrote the words and John Rogers Thomas wrote the music for a song "Tit, Tac, Toe" in 1876.[35]
* Episode 452 of This American Life[36] recounts the true story of a legal defense team that sought to overturn the state of Florida's decision to execute a mentally ill murderer by eliciting a tic-tac-toe-playing chicken as evidence. Arcade games with tic-tac-toe-playing chickens were popular in the mid-1970s; the animals were trained using operant conditioning,[37] with the moves being chosen by computer and indicated to the chicken with a light invisible to the human player.[38]
* In the 1983 science-fiction film WarGames, global thermonuclear war is described as similar to tic-tac-toe, in that if all sides engage in full-scale use of their arsenals with the most effective strategies possible, no side will actually win.

Various game shows have been based on tic-tac-toe and its variants:[citation needed]

* On Hollywood Squares, nine celebrities filled the cells of the tic-tac-toe grid; players put symbols on the board by correctly agreeing or disagreeing with a celebrity's answer to a question. Variations of the show include Storybook Squares and Hip Hop Squares. The British version was Celebrity Squares. Australia had various versions under the names of Celebrity Squares, Personality Squares and All Star Squares.
* In Tic-Tac-Dough, players put symbols up on the board by answering questions in various categories, which shuffle after both players have taken both turns.
* In Beat the Teacher, contestants answer questions to win a turn to influence a tic-tac-toe grid.
* On The Price Is Right, several national variants feature a pricing game called "Secret X", in which players must guess prices of two small prizes to win Xs (in addition to one free X) to place on a blank board. They must place the Xs in position to guess the location of the titular "secret X" hidden in the center column of the board and form a tic-tac-toe line horizontally (across) or diagonally (no vertical lines allowed). There are no Os in this variant of the game.
* On Minute to Win It, the game Ping Tac Toe has one contestant playing the game with nine water-filled glasses and white and orange ping-pong balls, trying to get three in a row of either color. They must alternate colors after each successful landing and must be careful not to block themself.

## See also

[edit]

* Hales–Jewett theorem
* m,n,k-game
* Number Scrabble

## References

[edit]

1. ^ Garcia, Dan. "GamesCrafters: Tic-Tac-Toe". gamescrafters.berkeley.edu. Retrieved June 8, 2021.
2. ^ "The History of Tic Tac Toe and Where it is Now". Aurosi. July 1, 2019. Retrieved June 8, 2021.
3. ^ Schaefer, Steve (2002). "MathRec Solutions (Tic-Tac-Toe)". Mathematical Recreations. Archived from the original on June 28, 2013. Retrieved September 18, 2015.
4. ^ W., Weisstein, Eric. "Tic-Tac-Toe". mathworld.wolfram.com. Retrieved May 12, 2017.`{{cite web}}`: CS1 maint: multiple names: authors list (link)
5. ^ Pham, Duc-Nghia; Park, Seong-Bae (November 12, 2014). PRICAI 2014: Trends in Artificial Intelligence: 13th Pacific Rim International Conference on Artificial Intelligence. Springer. p. 735\. ISBN 978-3-319-13560-1.
6. ^ a b c Golomb, Solomon W.; Hales, Alfred W. (2002). "Hypercube tic-tac-toe" (PDF). More Games of No Chance (Berkeley, CA, 2000). Math. Sci. Res. Inst. Publ. 42. Cambridge Univ. Press: 167–182\. MR 1973012. Archived (PDF) from the original on February 6, 2011.167-182&rft.date=2002&rft_id=https://mathscinet.ams.org/mathscinet-getitem?mr=1973012#id-name=MR&rft.aulast=Golomb&rft.aufirst=Solomon+W.&rft.au=Hales,+Alfred+W.&rft_id=http://library.msri.org/books/Book42/files/golomb.pdf&rfr_id=info:sid/en.wikipedia.org:Tic-tac-toe" class="Z3988">
7. ^ Zaslavsky, Claudia (1982). Tic Tac Toe: And Other Three-In-A Row Games from Ancient Egypt to the Modern Computer. Crowell. ISBN 0-690-04316-3.
8. ^ Parker, Marla (1995). She Does Math!: Real-life Problems from Women on the Job. Mathematical Association of America. p. 153\. ISBN 978-0-88385-702-1.
9. ^ "Tic tac toe Ancient Roman 1st century BC". Sweetooth Design Company. Retrieved December 4, 2016.
10. ^ "Morris Games". www-cs.canisius.edu. Archived from the original on March 13, 2013. Retrieved September 5, 2012.
11. ^ Notes and Queries . Series 2. Vol. VI. p. 152 - via Wikisource. [scan ]
12. ^ Oxford English Dictionary entries for "Noughts and Crosses", "Tick-Tack" and "Tick-Tack-Toe", dictionary.oed.com
13. ^ a b Wolf, Mark J. P. (August 16, 2012). Encyclopedia of Video Games: The Culture, Technology, and Art of Gaming. Greenwood Publishing Group. pp. 3–7\. ISBN 978-0-313-37936-9.3-7&rft.pub=Greenwood+Publishing+Group&rft.date=2012-08-16&rft.isbn=978-0-313-37936-9&rft.aulast=Wolf&rft.aufirst=Mark+J.+P.&rfr_id=info:sid/en.wikipedia.org:Tic-tac-toe" class="Z3988">
14. ^ Cohen, D.S. (March 12, 2019). "OXO aka Noughts and Crosses". Lifewire. Retrieved August 29, 2019.
15. ^ "Tinkertoys and tic-tac-toe". Archived from the original on August 24, 2007. Retrieved September 27, 2007.
16. ^ Original Tinkertoy Computer. January 5, 1978.
17. ^ Bolon, Thomas (2013). How to never lose at Tic-Tac-Toe. BookCountry. p. 7\. ISBN 978-1-4630-0192-6.
18. ^ Delinski, Bernie (January 21, 2014). "Searching for the cat in tic tac toe". timesdaily.com. Times Daily.
19. ^ Kevin Crowley, Robert S. Siegler (1993). "Flexible Strategy Use in Young Children's Tic-Tac-Toe". Cognitive Science. 17 (4): 531–561\. doi:10.1207/s15516709cog1704_3.531-561&rft.date=1993&rft_id=info:doi/10.1207/s15516709cog1704_3&rft.au=Kevin+Crowley,+Robert+S.+Siegler&rft_id=https://doi.org/10.1207%2Fs15516709cog1704_3&rfr_id=info:sid/en.wikipedia.org:Tic-tac-toe" class="Z3988">
20. ^ Gardner, Martin (1988). Hexaflexagons and Other Mathematical Diversions. University of Chicago Press. ISBN 978-0-226-28254-1.
21. ^ Kutschera, Ant (April 7, 2018). "The best opening move in a game of tic-tac-toe". The Kitchen in the Zoo. Retrieved August 29, 2019.
22. ^ Patashnik, Oren (September 1, 1980). "Qubic: 4 × 4 × 4 Tic-Tac-Toe". Mathematics Magazine. 53 (4): 202–216\. doi:10.2307/2689613. ISSN 0025-570X. JSTOR 2689613.202-216&rft.date=1980-09-01&rft.issn=0025-570X&rft_id=https://www.jstor.org/stable/2689613#id-name=JSTOR&rft_id=info:doi/10.2307/2689613&rft.aulast=Patashnik&rft.aufirst=Oren&rfr_id=info:sid/en.wikipedia.org:Tic-tac-toe" class="Z3988">
23. ^ Averbach, Bonnie; Chein, Orin (2000). Problem Solving Through Recreational Mathematics. Dover Publications. p. 252. ISBN 978-0-486-40917-7.
24. ^ Mendelson, Elliott (2016). Introducing Game Theory and its Applications. CRC Press. p. 19\. ISBN 978-1-4822-8587-1.
25. ^ "Wild Tic-Tac-Toe". Puzzles in Education. December 11, 2007. Retrieved August 29, 2019.
26. ^ Epstein, Richard A. (December 28, 2012). The Theory of Gambling and Statistical Logic. Academic Press. p. 450\. ISBN 978-0-12-397870-7.
27. ^ a b c Juul, Jesper (2011). Half-Real: Video Games Between Real Rules and Fictional Worlds. MIT Press. p. 51\. ISBN 978-0-262-51651-8.
28. ^ Michon, John A. (January 1, 1967). "The Game of JAM: An Isomorph of Tic-Tac-Toe". The American Journal of Psychology. 80 (1): 137–140\. doi:10.2307/1420555. JSTOR 1420555. PMID 6036351.137-140&rft.date=1967-01-01&rft_id=info:pmid/6036351&rft_id=https://www.jstor.org/stable/1420555#id-name=JSTOR&rft_id=info:doi/10.2307/1420555&rft.aulast=Michon&rft.aufirst=John+A.&rfr_id=info:sid/en.wikipedia.org:Tic-tac-toe" class="Z3988">
29. ^ "TicTacToe Magic" (PDF). Archived from the original (PDF) on December 20, 2016. Retrieved December 17, 2016.
30. ^ "Tic-Tac-Toe as a Magic Square". Oh Boy! I Get to do Math!. May 30, 2015. Retrieved August 29, 2019.
31. ^ Schumer, Peter D. (2004). Mathematical Journeys. John Wiley & Sons. pp. 71–72\. ISBN 978-0-471-22066-4.71-72&rft.pub=John+Wiley+&+Sons&rft.date=2004&rft.isbn=978-0-471-22066-4&rft.aulast=Schumer&rft.aufirst=Peter+D.&rft_id=https://books.google.com/books?id=tV__OQ8LZcgC&pg;=PA71&rfr_id=info:sid/en.wikipedia.org:Tic-tac-toe" class="Z3988">
32. ^ "Check Lines". BoardGameGeek. Retrieved August 29, 2019.
33. ^ Twice crosses-circles
34. ^ Goff, Allan (November 2006). "Quantum tic-tac-toe: A teaching metaphor for superposition in quantum mechanics". American Journal of Physics. 74 (11). College Park, MD: American Association of Physics Teachers: 962–973\. Bibcode:2006AmJPh..74..962G. doi:10.1119/1.2213635. ISSN 0002-9505.962-973&rft.date=2006-11&rft.issn=0002-9505&rft_id=info:doi/10.1119/1.2213635&rft_id=info:bibcode/2006AmJPh..74..962G&rft.aulast=Goff&rft.aufirst=Allan&rfr_id=info:sid/en.wikipedia.org:Tic-tac-toe" class="Z3988">
35. ^ "Tit, tat, toe". The Library of Congress. Retrieved August 29, 2019.
36. ^ "452: Poultry Slam 2011". This American Life. December 2, 2011. Retrieved May 28, 2016.
37. ^ Trillin, Calvin (February 1, 1999). "The Chicken Vanishes". The New Yorker. ISSN 0028-792X. Retrieved August 29, 2019.
38. ^ "Why did the chicken win the game? Conditioning". Star Tribune. August 28, 2018. Retrieved September 15, 2019.

## External links

[edit]

* The dictionary definition of tic-tac-toe at Wiktionary
* Media related to Tic Tac Toe at Wikimedia Commons
* "Tic-Tac-Toe". Wolfram MathWorld. March 11, 2002.
* "etymology – Why is a tie in Tic-Tac-Toe called a "Cat's Game?"". English Language & Usage Stack Exchange. March 5, 2014. – Discussion about the term "cat's game" for a drawn game of tic-tac-toe

* v
* t
* e

Tic-tac-toe

Variants|

* 3D tic-tac-toe
* Gomoku
* Notakto
* Treblecross
* Number Scrabble
* Order and Chaos
* Pente
* Quantum tic-tac-toe
* Renju
* SOS
* Ultimate tic-tac-toe
* Wild tic-tac-toe

Related concepts|

* m,n,k-game
* nd game
* Kaplansky's game
* Harary's generalized tic-tac-toe
* Hales–Jewett theorem
* Strategy-stealing argument
* Futile game
* Paper-and-pencil game

Similar games|

* Achi
* Connect Four
* Connect6
* Gobblet
* Nine Holes
* Nine men's morris
* OXO
* Pentago
* Quarto
* Score Four
* Tic-Stac-Toe
* Teeko
* Three men's morris
* Toss Across

* v
* t
* e

Topics of game theory

Definitions|

* Congestion game
* Cooperative game
* Determinacy
* Escalation of commitment
* Extensive-form game
* First-player and second-player win
* Game complexity
* Graphical game
* Hierarchy of beliefs
* Information set
* Normal-form game
* Perfect recall
* Preference
* Sequential game
* Simultaneous game
* Simultaneous action selection
* Solved game
* Succinct game
* Mechanism design

Equilibrium
concepts|

* Bayes correlated equilibrium
* Bayesian Nash equilibrium
* Berge equilibrium
* Core
* Correlated equilibrium
* Coalition-proof Nash equilibrium
* Epsilon-equilibrium
* Evolutionarily stable strategy
* Gibbs equilibrium
* Mertens-stable equilibrium
* Markov perfect equilibrium
* Nash equilibrium
* Pareto efficiency
* Perfect Bayesian equilibrium
* Proper equilibrium
* Quantal response equilibrium
* Quasi-perfect equilibrium
* Risk dominance
* Satisfaction equilibrium
* Self-confirming equilibrium
* Sequential equilibrium
* Shapley value
* Strong Nash equilibrium
* Subgame perfection
* Trembling hand equilibrium

Strategies|

* Appeasement
* Backward induction
* Bid shading
* Collusion
* Cheap talk
* De-escalation
* Deterrence
* Escalation
* Forward induction
* Grim trigger
* Markov strategy
* Pairing strategy
* Dominant strategies
* Pure strategy
* Mixed strategy
* Strategy-stealing argument
* Tit for tat

Classes
of games|

* Auction
* Bargaining problem
* Differential game
* Global game
* Intransitive game
* Mean-field game
* n-player game
* Perfect information
* Large Poisson game
* Potential game
* Repeated game
* Screening game
* Signaling game
* Strictly determined game
* Stochastic game
* Symmetric game
* Zero-sum game

Games|

* Go
* Chess
* Infinite chess
* Checkers
* All-pay auction
* Prisoner's dilemma
* Gift-exchange game
* Optional prisoner's dilemma
* Traveler's dilemma
* Coordination game
* Chicken
* Centipede game
* Lewis signaling game
* Volunteer's dilemma
* Dollar auction
* Battle of the sexes
* Stag hunt
* Matching pennies
* Ultimatum game
* Electronic mail game
* Rock paper scissors
* Pirate game
* Dictator game
* Public goods game
* Blotto game
* War of attrition
* El Farol Bar problem
* Fair division
* Fair cake-cutting
* Bertrand competition
* Cournot competition
* Stackelberg competition
* Deadlock
* Diner's dilemma
* Guess 2/3 of the average
* Kuhn poker
* Nash bargaining game
* Induction puzzles
* Trust game
* Princess and monster game
* Rendezvous problem
* Pursuit game

Theorems|

* Aumann's agreement theorem
* Folk theorem
* Minimax theorem
* Nash's theorem
* Negamax theorem
* One-shot deviation principle
* Purification theorem
* Revelation principle
* Sprague–Grundy theorem
* Zermelo's theorem

Key
figures|

* Albert W. Tucker
* Amos Tversky
* Antoine Augustin Cournot
* Ariel Rubinstein
* Claude Shannon
* Daniel Kahneman
* David K. Levine
* David M. Kreps
* Donald B. Gillies
* Drew Fudenberg
* Eric Maskin
* Harold W. Kuhn
* Herbert Simon
* Hervé Moulin
* John Conway
* Jean Tirole
* Jean-François Mertens
* Jennifer Tour Chayes
* John Harsanyi
* John Maynard Smith
* John Nash
* John von Neumann
* Kenneth Arrow
* Kenneth Binmore
* Leonid Hurwicz
* Lloyd Shapley
* Melvin Dresher
* Merrill M. Flood
* Olga Bondareva
* Oskar Morgenstern
* Paul Milgrom
* Peyton Young
* Reinhard Selten
* Robert Axelrod
* Robert Aumann
* Robert B. Wilson
* Roger Myerson
* Samuel Bowles
* Suzanne Scotchmer
* Thomas Schelling
* William Vickrey

Search optimizations|

* Alpha–beta pruning
* Aspiration window
* Principal variation search
* max^n algorithm
* Paranoid algorithm
* Lazy SMP

Miscellaneous|

* Bounded rationality
* Combinatorial game theory
* Confrontation analysis
* Coopetition
* Evolutionary game theory
* Glossary of game theory
* List of game theorists
* List of games in game theory
* No-win situation
* Topological game
* Tragedy of the commons

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template