From b5fae350755081330bc7d528714be7104b365330 Mon Sep 17 00:00:00 2001 From: neogeek23 Date: Wed, 17 May 2017 08:44:44 -0500 Subject: [PATCH] Update README.md minor text change --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index fe1b20b..6369ee5 100644 --- a/README.md +++ b/README.md @@ -1,6 +1,6 @@ # 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 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). Example winning paths in 4 space: