bstein/Tic-Tac-Toe
1
0
Fork 0
mirror of https://github.com/neogeek23/Tic-Tac-Toe.git synced 2026-02-04 02:48:16 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update README.md

Browse Source 
Made usage more clear.
This commit is contained in:
neogeek23 2017-05-13 11:21:01 -05:00 committed by GitHub
parent ee74292314
commit 6f11d072ad
1 changed files with 13 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
README.md
View File

@ -1,5 +1,17 @@
# Tic-Tac-Toe
So this is how tic tac toe would work if it was in n-space. I think. Basically you must claim n+1 adjacent spaces. Being adjacent means that the closest next space is no more than 1 location away in each coordinate. For example a space that is (over-over, up) is not adjacent, but (over, up) would be or for 3-space (over-over, up, over) would not be and (over, over, down) would be.
So this is how tic tac toe would work if it was in n-space. I think. Basically you must claim n+1 continuous spaces in some cross section or throughout the entire n-space. Being continuous means that the closest next space is no more than 1 location away in each coordinate but is also at least 1 location away in at least 1 coordinate (otherwise it'd be the same point).
Example winning paths in 4 space:
2d - CS 3d - CS No CS 1d - CS
(0.1.2.3) (2.2.2.2) (0.0.0.0) (0.1.2.3)
(0.2.2.2) (1.2.1.1) (1.1.1.1) (1.1.2.3)
(0.3.2.1) (0.2.0.0) (2.2.2.2) (2.1.2.3)
(0.4.2.0) (4.2.4.4) (3.3.3.3) (3.1.2.3)
(0.0.2.4) (3.2.3.3) (4.4.4.4) (4.1.2.3)
CS = Cross Section, so a 3d cross section means that in larger space than 3 space only three dimensions can change. It could be 1,2,4 in 5 space or 2,3,7 in 10 space, it doesn't matter which three just that is three.
This program will produce a Tic-Tac-Toe board for any space/dimension > 1.
You get three tries to input a coordinate before the game asigns you a random unclaimed location.