1、调用SudoKuMaker()
初始化数独创建实例
2、实例调用setSudiMaker()
可以创建一个数独, 参数为难度, 选填1-30,每+1会增加两个空
3、实例调用getArr()
获取数独,为一个二元数组, 为 0 的地方表示此处为空
4、实例调用getAnswer()
获取一种数独答案,同样为一个二元数组
5、实例调用isWrong()
上传数独答案,会返回第一个错误的位置,没有错误则返回False
import random, copy
class SudoKuMaker():
def setSudoMaker(self, grade):
self.grade = grade
self.Arr = [[0] * 9 for i in range(9)]
self.Sodoku = [[0] * 9 for i in range(9)]
self.Game = [[0] * 9 for i in range(9)]
self.Answer = [[0] * 9 for i in range(9)]
self.rand(15)
self.DFS(self.Arr, 0)
self.diger(grade)
def rand(self, num):
t = 0
while num:
x = random.randint(0, 8)
y = random.randint(0, 8)
n = random.randint(1, 9)
if (self.Arr[x][y] == 0) & self.isTrue(x, y, n, self.Arr):
self.Arr[x][y] = n
num -= 1
def isTrue(self, x, y, n, array):
a = (0 if (x < 3) else 3) if (x < 6) else 6
b = (0 if (y < 3) else 3) if (y < 6) else 6
for i in range(a, a + 3):
for j in range(b, b + 3):
if array[i][j] == n: return False
for i in range(9):
if (array[x][i] == n) | (array[i][y] == n):
return False
return True
flag = False
def DFS(self, array, deepth):
if deepth < 81:
if self.flag: return
if array[int(deepth / 9)][deepth % 9] == 0:
for i in range(1, 10):
if self.isTrue(int(deepth / 9), deepth % 9, i, self.Arr):
array[int(deepth / 9)][deepth % 9] = i
self.DFS(array, deepth + 1)
array[int(deepth / 9)][deepth % 9] = 0
else:
self.DFS(array, deepth + 1)
else:
self.flag = True
self.Sodoku = copy.deepcopy(array)
self.Answer = copy.deepcopy(array)
def getDigNumber(self, grade):
if (grade <= 30) & (grade >= 1):
return grade * 2
else:
return 7
def diger(self, grade):
t = int(self.getDigNumber(grade))
while t:
x = random.randint(0, 8)
y = random.randint(0, 8)
if self.Sodoku[x][y] != 0:
self.Sodoku[x][y] = 0
t -= 1
self.Game = copy.deepcopy(self.Sodoku)
def getArr(self):
return self.Game
def getAnswer(self):
return self.Answer
def isWrong(self, array):
for i in range(9):
for j in range(9):
if self.getArr()[i][j] == 0:
temp = array[i][j]
array[i][j] = 0
if not self.isTrue(i, j, temp, array):
return (i,j)
array[i][j] = temp
return False
def main():
"""
说明:
1、调用SudoKuMaker()初始化数独创建实例
2、实例调用setSudiMaker()可以创建一个数独, 参数为难度, 选填1-30,每+1会增加两个空
3、实例调用getArr()获取数独,为一个二元数组, 为 0 的地方表示此处为空
4、实例调用getAnswer()获取一种数独答案,同样为一个二元数组
5、实例调用isWrong()上传数独答案,会返回第一个错误的位置,没有错误则返回False
"""
# 示例代码
mkr = SudoKuMaker()
mkr.setSudoMaker(30)
print(mkr.getArr())
print(mkr.getAnswer())
a = [[1, 3, 4, 5, 7, 8, 6, 9, 2], [7, 2, 8, 6, 1, 9, 3, 4, 5], [6, 9, 5, 3, 4, 2, 7, 1, 8], [4, 7, 1, 8, 3, 5, 2, 6, 9], [3, 5, 6, 2, 9, 1, 4, 8, 7], [9, 8, 2, 4, 6, 7, 5, 3, 1], [2, 4, 7, 1, 8, 3, 9, 5, 6], [5, 1, 3, 9, 2, 6, 8, 7, 4], [8, 6, 9, 7, 5, 4, 1, 2, 3]]
print(mkr.isWrong(a))
if __name__ == "__main__":
main()
缺点:10次生成有一次会生成失败,这是python本身的缺陷,不能递归1000次。