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
This commit is contained in:
Brad Stein 2018-01-01 16:34:54 -06:00 committed by GitHub
parent 47ea3aa921
commit 2b8a9948c8
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -1,6 +1,6 @@
# Tic-Tac-Toe
So this is how tic tac toe would work if it was in n-space. 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).
So this is how tic tac toe would work if it was in n-space. 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). Excessively large dimensional space may cause an overflow and crash. Suggested upper limit of six dimensional maximum.
Example winning paths in 4 space: