Python解标准数独

首先谈下数独的结构，9*9一共81个数格。标准数独要求每一行，每一列，每一宫格之内填入1-9 9个数字而不重复。其开始状态的给定数字最低为17个，根据难度降低，给定数字依次增加。

0、准备工作：本次数独算法设计的数据结构为列表+集合，一个列表中加入9个小列表，每个小列表中加入9个集合。填入给定的数字，其他空格全部填入{0-9}可能的数字，经过后面的算法，逐个消除，直到81个数格长度全部为1

list_Probably = {1, 2, 3, 4, 5, 6, 7, 8, 9}# 初始化空格
    list_0 = [0, 0, 0, 0, 0, 0, 0, 0, 0]
    list_1 = [0, 0, 0, 0, {1}, 0, 0, {9}, {2}]
    list_2 = [0, {8}, {6}, 0, 0, 0, 0, {4}, 0]
    list_3 = [0, 0, {1}, {5}, {6}, 0, 0, 0, 0]
    list_4 = [0, 0, 0, 0, 0, {3}, {6}, {2}, 0]
    list_5 = [0, 0, 0, 0, 0, 0, {5}, 0, {7}]
    list_6 = [0, {3}, 0, 0, 0, 0, 0, {8}, 0]
    list_7 = [0, {9}, 0, {8}, 0, {2}, 0, 0, 0]
    list_8 = [0, 0, {7}, 0, 0, {4}, {3}, 0, 0]
    list_Whole = [list_0, list_1, list_2, list_3, list_4, list_5, list_6, list_7, list_8]
    for i in range(len(list_Whole)):
        for j in range(len(list_Whole[i])):
            if list_Whole[i][j] == 0:
                list_Whole[i][j] = list_Probably  # 如果是0，就赋初值

经过初始化后，数独变为（最外层还有一对[]）：

[{1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}]
[{1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {9}, {2}]
[{1, 2, 3, 4, 5, 6, 7, 8, 9}, {8}, {6}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {4}, {1, 2, 3, 4, 5, 6, 7, 8, 9}]
[{1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1}, {5}, {6}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}]
[{1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {3}, {6}, {2}, {1, 2, 3, 4, 5, 6, 7, 8, 9}]
[{1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {5}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {7}]
[{1, 2, 3, 4, 5, 6, 7, 8, 9}, {3}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {8}, {1, 2, 3, 4, 5, 6, 7, 8, 9}]
[{1, 2, 3, 4, 5, 6, 7, 8, 9}, {9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {8}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {2}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}]
[{1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {7}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {4}, {3}, {1, 2, 3, 4, 5, 6, 7, 8, 9}, {1, 2, 3, 4, 5, 6, 7, 8, 9}]

1、规则一消去不可能的数字：假设第一行，第一列数字确定为1，那么第一行，第一列和第一宫格的其他数格都不可能再为1。那么第一行，第一列和第一宫格的其他数格的可能值就可以从

{1, 2, 3, 4, 5, 6, 7, 8, 9}

变成

{2, 3, 4, 5, 6, 7, 8, 9}

继续此思路，扫描9*9=81个数格，消去所有不可能的值：

规则一源码：

def romove_row_column_repeat(li):
    for i in range(len(li)):  # 去除同一行列的重复数据
        row_repeat = set()          #行重复
        column_repeat = set()       #列重复
        for j in range(len(li