3D tic-tac-toe, also known by the trade name Qubic, is a board game. It is similar in concept to traditional tic-tac-toe but is played in a cubical array of cells, usually 4x4x4. Players take turns placing their markers in blank cells in the array. The first player to achieve four of their own markers in a row wins. The winning row can be horizontal, vertical, or diagonal on a single board as in regular tic-tac-toe, or vertically in a column, or a diagonal line through four boards.
As with traditional tic-tac-toe, several commercial sets of apparatus have been sold for the game, and it may also be played with pencil and paper with a hand-drawn board.
The game has been analyzed mathematically and a first-player-win strategy was developed and published. However the strategy is too complicated for most human players to memorize and apply.
Pencil and paper
Like traditional 3x3 tic-tac-toe, the game may be played with pencil and paper. A game board can easily be drawn by hand, with players using the usual "naughts and crosses" to mark their moves.
"Qubic" is the brand name of equipment for the game that was manufactured and marketed by Parker Brothers, starting in 1964. It was reissued in 1972 with a more modern design. Both versions described the game as "Parker Brothers 3D Tic Tac Toe Game".
In the original issue the bottom level board was opaque plastic, and the upper three clear, all of simple square design. The 1972 reissue used four clear plastic boards with rounded corners. Unlike the usual pencil and paper play involving two players, using markers "X" and "O", Parker Brothers' rules said that up to three players could play. The circular playing pieces resembled small poker chips in red, blue, and yellow.
The game is no longer manufactured.
Game play and analysis
The 3x3x3 version of the game cannot end in a draw, and is easily won by the first player. The following applies to the 4x4x4 version of the game.
There are 76 winning lines. On each of the four 4x4 boards, or horizontal planes, there are four columns, four rows, and two diagonals, accounting for 40 lines. There are 16 vertical lines, each ascending from a cell on the bottom board through the corresponding cells on the other boards. There are eight vertically-oriented planes parallel to the sides of the boards, each of these adding two more diagonals (the horizontal and vertical lines of these planes have already been counted). Finally, there are two vertically-oriented planes that include the diagonal lines of the 4x4 boards, and each of these contributes two more diagonal lines—each of these including two corners and two internal cells.
The 16 cells lying on these latter four lines (that is, the eight corner cells and eight internal cells) are each involved in seven winning lines; the other 48 cells (24 face cells and 24 edge cells) are each involved in four winning lines.
The corner cells and the internal cells are actually equivalent via an automorphism; likewise for face and edge cells. The group of automorphisms of the game contains 192 automorphisms. It is made up of combinations of the usual rotations and reflections that reorient or reflect the cube, plus two that scramble the order of cells on each line. If a line comprises cells A, B, C and D in that order, one of these exchanges inner cells for outer ones (such as B, A, D, C) for all lines of the cube, and the other exchanges cells of either the inner or the outer cells ( A, C, B, D or equivalently D, B, C, A) for all lines of the cube. Combinations of these basic automorphisms generate the entire group of 192 as shown by R. Silver in 1967.
3D tic-tac-toe was weakly solved, meaning that the existence of a winning strategy was proven but without actually presenting such a strategy, by Eugene Mahalko in 1976. He proved that in two-person play, the first player will win if there are two optimal players.
A more complete analysis, including the announcement of a complete first-player-win strategy, was published by Oren Patashnik in 1980. Patashnik used a computer-assisted proof that consumed 1500 hours of computer time. The strategy comprised move choices for 2929 difficult "strategic" positions, plus assurances that all other positions that could arise could be easily won with a sequence entirely made up of forcing moves. It was further asserted that the strategy had been independently verified. As computer storage became cheaper and the internet made it possible, these positions and moves were made available online.
A more general analysis of tic-tac-toe-like games, including Qubic, appears in Combinatorial Games: Tic-Tac-Toe Theory by József Beck.
All of the analyses described above are for the two-player version of the game.
Fool's Mate strategy
|This section does not cite any sources. (November 2015) (Learn how and when to remove this template message)|
||This section may be confusing or unclear to readers. In particular, whether X or O has the first move, whether "provided that X does not move on a powerpoint" applies only to X's first move or to all of them, and why there are only five "available powerpoints" for peg B. (November 2015) (Learn how and when to remove this template message)|
The cube structure makes the 8 corner-points and 8 centre-points extremely important; each of these is a member of 6 planes (1×flat, 2×vertical, 2×diagonal-vertical, 1×cross-vertical) of 16 points. The flat and 2×vertical planes only contain 4 important points, while the 2×diagonal-vertical and cross-vertical contain 8 powerpoints.
O begins and places his first peg A on any one of the 16 powerpoints. Even if X places his first peg on a plane involving A there will be other planes involving A where O can place his second peg B; and on any such plane there will be 3 or 7 available powerpoints.
Even if X places his second peg on a plane including A & B there still remains a plane where O can place a third peg C onto one of the 2 or 6 available powerpoints. Here X must be foolish and allow a fourth O ‘1’ to be placed in that plane.
Once A, B, C & 1 are placed then there is a forced win with a further 5 pegs by O since X must respond with x1; then 2, x2; 3, x3 and so on.
.A.x3..3..B .1..5..2..w x1.x2..4... .C....x4..w
Several computer programs that play the game against a human opponent have been written. The earliest used text or similar interaction: the human player would enter moves numerically (such as "4 2 3" for fourth level, second row, third column) on a console typewriter or time-sharing terminal and the program would respond similarly, as graphics displays were uncommon.
William Daly Jr. wrote and described a Qubic-playing program as part of his Master's program at the Massachusetts Institute of Technology. The program was written in assembler language for the TX-0 computer. It included lookahead to 12 moves and kept a history of previous games with each opponent, modifying its strategy according to their past behavior.
An implementation in Fortran was written by Robert K. Louden and presented, with extensive description of its design, in his book Programming the IBM 1130 and 1800. Its strategy involved looking for combinations of one or two free cells shared among two or three rows with particular contents.
A Qubic program in a DEC dialect of BASIC appeared in 101 BASIC Computer Games by David H. Ahi. Ahi said the program "showed up," author unknown, on a G.E. timesharing system in 1968.
Atari released a graphical version of the game for the Atari 2600 console and Atari 8-bit computers in 1979. The program was written by Carol Shaw, who went on to greater fame as the creator of Activision's River Raid. It uses the standard joystick controller. It can be played by two players against each other, or one player can play against the program on one of eight different difficulty settings. The product code for the Atari game was CX-2618.
Three-dimensional tic-tac-toe on a 4x4x4 board (optionally 3x3x3) was included in the Microsoft Windows Entertainment Pack in the 1990s under the name TicTactics. In 2010 Microsoft made the game available on its Game Room service for its Xbox 360 console.
Besides the obviously-related tic tac toe, a popular variant is a commercial product called "Score Four". In Score Four the "markers" are small spheres with a hole drilled all the way through. The base of the game board provides 16 vertical spikes. To make a move, a player places a sphere on one of the spikes. Thus a move can only be made in a cell wherein all of the cells below it are already occupied.
- "Trademark Status & Document Retrieval (TSDR)". United States Patent and Trademark Office.
- R. Silver (1967). "The group of automorphisms of the game of 3-dimensional ticktacktoe". Amer. Math. Monthly (74): 247–254.
- Eugene D. Mahalko (1976). A Possible Win Strategy for the Game of Qubic (M.Sc. thesis). Brigham Young University,.
- Oren Patashnik (September 1980). "Qubic: 4 x 4 x 4 Tic-Tac-Toe". Mathematics Magazine 53 (4): 202–216.
- Patashnik's Solution on Google Drive
- L .V. Allis and P. N. A. Schoo (1992). "Qubic solved again". In H. J. van den Herik, L. V. Allis. Heuristic Programming in Artificial Intelligence 3: The Third Computer Olympiad. Ellis Horwood, Chichester, UK. pp. 192–204.
- József Beck (April 2008). Combinatorial Games: Tic-Tac-Toe Theory. Cambridge University Press. ISBN 9780521461009.
- William George Daly Jr. (February 1961). Computer Strategies for the Game of Qubic (PDF) (M.Sc.). Massachusetts Institute of Technology.
- Robert K. Louden (1967). "Integer manipulation in FORTRAN". Programming the IBM 1130 and 1800. Prentice-Hall. pp. 179–204. ASIN B0006BRBTQ.
- David H. Ahi (1975). 101 BASIC Computer Games (PDF). Digital Equipment Corporation. pp. 175–177.
- "3-D Tic-Tac-Toe at MobyGames".
- "(Atari Ad)". The San Bernardino County Sun (San Bernardino, California). 5 August 1981. Retrieved 6 August 2014 – via Newspapers.com.
- Qubist source code on SourceForge