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

Go to file

neogeek23 332a21eeca Add files via upload

Fixed issue with continuity removal where paths involving wrapping around the space were not properly removed,  These paths are now prevented from being considered.
Updated placement request string to inform the user of both the player that was playing and the token that player is using.

2017-05-13 10:18:07 -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:18:07 -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.