Working on search()

This commit is contained in:
Eryn Wells 2013-08-30 10:11:44 -07:00
parent 81e3296f6f
commit cc5e35ff81

View file

@ -135,6 +135,14 @@ class Board(dict):
raise
return self.solved
def search(self):
if self.solved:
return True
# Chose the square with the fewest possible values.
_, smallest = min((len(self[sq]), sq) for sq in self if len(self[sq]) > 1)
# Deepcopy the board.
def assign(self, square, value):
'''
Assign {value} to {square}. {value} is expected to be an iterable (a list). {key} should be a valid (x, y)