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 tictactoe.py

Browse Source 
Updated comments to be less confusing.
This commit is contained in:
neogeek23 2017-05-13 10:56:01 -05:00 committed by GitHub
parent 76aa1ba676
commit ee74292314
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
tictactoe.py
View File

@ -189,9 +189,10 @@ class Board:
return None
def __get_dimension_locks(self):
# This gets all unique permutations of True-False for each dimension so 2^n elements
# This is used to create a matrix of all the possible cross sections of a n-space
# This is also used to pattern all the ways to manipulate a 1-dimensional element, increase/decrease it
# This gets all unique permutations of True-False for each dimension so 2^n elements.
# This is used as a matrix to know when to freeze a dimension to create cross sections of a n-space,
# it gets all possibilities.
# This is also used to pattern all the ways to manipulate a 2-dimensional element, increase/decrease it.
final = list()
initial = list()
@ -211,7 +212,7 @@ class Board:
def __get_winning_paths(self, coord_list, freedoms):
path_set = list()
# This will get all possible paths that are 5 long from the starting point
# This will get all possible paths that are n+1 long from the starting point, including wraparounds
for freedom in freedoms:
result = list()
for edit_pattern in freedoms: