mirror of https://github.com/neogeek23/Tic-Tac-Toe.git synced 2026-02-04 02:48:16 +00:00

Go to file

neogeek23 8812a19dfd Add files via upload

Noticed small typos.  Typos corrected.
Updated dimension input to alert user that dimensions above 5 may take time to produce.  Seems like the 8th dimension takes forever - I expect in either the 8th or 9th to run out of memory.

2017-05-13 10:37:40 -05:00

README.md

Update README.md

2017-05-11 07:02:14 -05:00

tictactoe.py

Add files via upload

2017-05-13 10:37:40 -05:00

README.md

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.