To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

From Wikipedia, the free encyclopedia

A nd game (or nk game) is a generalization of the combinatorial game tic-tac-toe to higher dimensions.[1][2][3] It is a game played on a nd hypercube with 2 players.[1][2][4][5] If one player creates a line of length n of their symbol (X or O) they win the game. However, if all nd spaces are filled then the game is a draw.[4] Tic-tac-toe is the game where n equals 3 and d equals 2 (3, 2).[4] Qubic is the (4, 3) game.[4] The (n > 0, 0) or (1, 1) games are trivially won by the first player as there is only one space (n0 = 1 and 11 = 1). A game with d = 1 and n > 1 cannot be won if both players are playing well as an opponent's piece will block the one-dimensional line.[5]

Game theory

Unsolved problem in mathematics:

Given a width of tic-tac-toe board, what is the smallest dimension such that X is guaranteed a winning strategy?

An nd game is a  symmetric  combinatorial game.

There are a total of winning lines in a nd game.[2][6]

For any width n, at some dimension d (thanks to the Hales-Jewett theorem), there will always be a winning strategy for player X. There will never be a winning strategy for player O because of the Strategy-stealing argument since an nd game is  symmetric.

See also

References

  1. ^ a b "Mathllaneous" (PDF). Retrieved 16 December 2016.
  2. ^ a b c Beck, József (20 March 2008). Combinatorial Games: Tic-Tac-Toe Theory. Cambridge University Press. ISBN 9780521461009.
  3. ^ Tichy, Robert F.; Schlickewei, Hans Peter; Schmidt, Klaus D. (10 July 2008). Diophantine Approximation: Festschrift for Wolfgang Schmidt. Springer. ISBN 9783211742808.
  4. ^ a b c d Golomb, Solomon; Hales, Alfred. "Hypercube Tic-Tac-Toe" (PDF). Archived from the original (PDF) on 29 April 2016. Retrieved 16 December 2016.
  5. ^ a b Shih, Davis. "A Scientific Study: k-dimensional Tic-Tac-Toe" (PDF). Retrieved 16 December 2016.
  6. ^ Epstein, Richard A. (28 December 2012). The Theory of Gambling and Statistical Logic. Academic Press. ISBN 9780123978707.

External links

This page was last edited on 4 April 2024, at 03:42
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.