mirror of
https://github.com/neogeek23/Tic-Tac-Toe.git
synced 2026-02-04 10:58:17 +00:00
6 lines
510 B
Markdown
6 lines
510 B
Markdown
# 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.
|
|
|
|
You get three tries to input a coordinate before the game asigns you a random unclaimed location.
|