ganyishang
滚蛋吧代码君
2021-01-31 21:49
采纳率: 70%
浏览 72

求用python代码求解电子表数独和算式数独

标准数独概念如下:

现有求解代码:

import datetime

sudoku2 = [
    [0, 4, 0,    5, 1, 7,    0, 6, 0],
    [2, 0, 0,    0, 4, 0,    0, 0, 9],
    [0, 0, 3,    0, 0, 0,    5, 0, 0],

    [5, 0, 0,    4, 0, 1,    0, 0, 7],
    [9, 2, 0,    0, 0, 0,    0, 8, 5],
    [7, 0, 0,    9, 0, 5,    0, 0, 1],

    [0, 0, 8,    0, 0, 0,    7, 0, 0],
    [6, 0, 0,    0, 7, 0,    0, 0, 8],
    [0, 5, 0,    8, 6, 9,    0, 3, 0]
]

def wr_sudoku(board):  # 判断数独是否符合条件
    # 判断一行是否有效
    for i in range(9):
        for j in board[i]:
            if (j != '.') and (board[i].count(j) > 1):
                return False
        # 判断一列是否有效
        column = [k[i] for k in board]
        for n in column:
            if (n != '.') and (board[i].count[n] > 1):
                return False
    # 判断九宫格是否有效
    for i in range(3):
        for j in range(3):
            grid = [tem[j * 3:(j + 1) * 3] for tem in board[i * 3:(i + 1) * 3]]
            merge_str = grid[0] + grid[1] + grid[2]  # 合并为一个list[]
            for m in merge_str:
                if (m != '.') and (merge_str.count(m) > 1):
                    return False
    return True


class fill_sudoku(object):
    def __init__(self, board):
        self.b = board
        self.t = 0

    def check(self, x, y, value):  # 检查每行每列及每九宫是否有相同项
        for row_item in self.b[x]:
            if row_item == value:
                return False
        for row_all in self.b:
            if row_all[y] == value:
                return False
        row, col = int(x / 3) * 3, int(y / 3) * 3
        row3col3 = self.b[row][col:col + 3] + self.b[row + 1][col:col + 3] + self.b[row + 2][col:col + 3]
        for row3col3_item in row3col3:
            if row3col3_item == value:
                return False
        return True

    def get_next(self, x, y):  # 得到下一个未填项
        for next_soulu in range(y + 1, 9):
            if self.b[x][next_soulu] == 0:
                return x, next_soulu
        for row_n in range(x + 1, 9):
            for col_n in range(0, 9):
                if self.b[row_n][col_n] == 0:
                    return row_n, col_n
        return -1, -1  # 若无下一个未填项,返回-1

    def try_it(self, x, y):  # 主循环
        if self.b[x][y] == 0:
            for i in range(1, 10):  # 从1到9尝试
                self.t += 1
                if self.check(x, y, i):  # 符合 行列宫均无条件 的
                    self.b[x][y] = i  # 将符合条件的填入0格
                    next_x, next_y = self.get_next(x, y)  # 得到下一个0格
                    if next_x == -1:  # 如果无下一个0格
                        return True  # 返回True
                    else:  # 如果有下一个0格,递归判断下一个0格直到填满数独
                        end = self.try_it(next_x, next_y)
                        if not end:  # 在递归过程中存在不符合条件的,即 使try_it函数返回None的项
                            self.b[x][y] = 0  # 回朔到上一层继续
                        else:
                            return True
    def start(self):
        begin = datetime.datetime.now()
        if self.b[0][0] == 0:
            self.try_it(0, 0)
        else:
            x, y = self.get_next(0, 0)
            self.try_it(x, y)
        for i in self.b:
            print(i)
        end = datetime.datetime.now()
        print('cost time: ', end - begin)
        print('times: ', self.t)
        return
s = fill_sudoku(sudoku2)
s.start()

求改编代码解电子表数独和算式数独

  • 点赞
  • 写回答
  • 关注问题
  • 收藏
  • 邀请回答

2条回答 默认 最新

  • jslang
    天际的海浪 2021-02-01 16:20
    已采纳
    # 电子时钟数独
    
    import datetime
    
    sudoku2 = [
        [0, 6, 4,    7, 9, 0,    0, 0, 0],
        [0, 0, 0,    0, 0, 0,    0, 0, 4],
        [0, 0, 0,    0, 0, 1,    0, 0, 6],
    
        [0, 0, 9,    0, 0, 0,    0, 0, 7],
        [4, 0, 0,    0, 0, 0,    0, 0, 8],
        [7, 0, 0,    0, 0, 0,    6, 0, 0],
    
        [9, 0, 0,    4, 0, 0,    0, 0, 0],
        [2, 0, 0,    0, 0, 0,    0, 0, 0],
        [0, 0, 0,    0, 6, 7,    2, 5, 0]
    ]
    
    
    
    class fill_sudoku(object):
        def __init__(self, board):
            self.b = board
            self.t = 0
    
        KH = (
            (1,1),(1,2),(1,3),
            (1,7),(2,7),(3,7),
            (4,1),(5,1),(6,1),
            (7,4),(7,5),(7,6)
        )
    
        def check(self, x, y, value):  # 检查每行每列及每九宫是否有相同项
            for row_item in self.b[x]:
                if row_item == value:
                    return False
            for row_all in self.b:
                if row_all[y] == value:
                    return False
            row, col = int(x / 3) * 3, int(y / 3) * 3
            row3col3 = self.b[row][col:col + 3] + self.b[row + 1][col:col + 3] + self.b[row + 2][col:col + 3]
            for row3col3_item in row3col3:
                if row3col3_item == value:
                    return False
    
            if (x,y) in self.KH:
                p = self.KH.index((x,y))
                if p%3==0:
                    if value>2:
                        return False
                elif p%3==1:
                    tx,ty = self.KH[p-1]
                    if self.b[tx][ty]*10+value>23:
                        return False
                else:
                    if value>5:
                        return False
    
            return True
    
        def get_next(self, x, y):  # 得到下一个未填项
            for next_soulu in range(y + 1, 9):
                if self.b[x][next_soulu] == 0:
                    return x, next_soulu
            for row_n in range(x + 1, 9):
                for col_n in range(0, 9):
                    if self.b[row_n][col_n] == 0:
                        return row_n, col_n
            return -1, -1  # 若无下一个未填项,返回-1
    
        def try_it(self, x, y):  # 主循环
            if self.b[x][y] == 0:
                for i in range(1, 10):  # 从1到9尝试
                    self.t += 1
                    if self.check(x, y, i):  # 符合 行列宫均无条件 的
                        self.b[x][y] = i  # 将符合条件的填入0格
                        next_x, next_y = self.get_next(x, y)  # 得到下一个0格
                        if next_x == -1:  # 如果无下一个0格
                            return True  # 返回True
                        else:  # 如果有下一个0格,递归判断下一个0格直到填满数独
                            end = self.try_it(next_x, next_y)
                            if not end:  # 在递归过程中存在不符合条件的,即 使try_it函数返回None的项
                                self.b[x][y] = 0  # 回朔到上一层继续
                            else:
                                return True
        def start(self):
            begin = datetime.datetime.now()
            if self.b[0][0] == 0:
                self.try_it(0, 0)
            else:
                x, y = self.get_next(0, 0)
                self.try_it(x, y)
            for i in self.b:
                print(i)
            end = datetime.datetime.now()
            print('cost time: ', end - begin)
            print('times: ', self.t)
            return
    s = fill_sudoku(sudoku2)
    s.start()
    点赞 1 评论
  • jslang
    天际的海浪 2021-02-01 16:40
    # 算式数独
    
    import datetime
    
    sudoku2 = [
        [0, 5, 9,    0, 0, 0,    6, 1, 0],
        [8, 0, 0,    0, 6, 0,    0, 0, 5],
        [6, 0, 0,    3, 0, 9,    0, 0, 8],
    
        [0, 0, 6,    0, 3, 0,    4, 0, 0],
        [0, 9, 0,    4, 0, 6,    0, 8, 0],
        [0, 0, 1,    0, 9, 0,    7, 0, 0],
    
        [1, 0, 0,    5, 0, 7,    0, 0, 3],
        [9, 0, 0,    0, 1, 0,    0, 0, 7],
        [0, 6, 5,    0, 0, 0,    8, 2, 0]
    ]
    
    
    
    class fill_sudoku(object):
        def __init__(self, board):
            self.b = board
            self.t = 0
    
        KH = (
            (2,2),(2,7),(7,2),(7,7)
        )
    
        def check(self, x, y, value):  # 检查每行每列及每九宫是否有相同项
            for row_item in self.b[x]:
                if row_item == value:
                    return False
            for row_all in self.b:
                if row_all[y] == value:
                    return False
            row, col = int(x / 3) * 3, int(y / 3) * 3
            row3col3 = self.b[row][col:col + 3] + self.b[row + 1][col:col + 3] + self.b[row + 2][col:col + 3]
            for row3col3_item in row3col3:
                if row3col3_item == value:
                    return False
    
            if (x,y) in self.KH:
                if self.b[x-1][y-1] * self.b[x-1][y] != self.b[x][y-1]*10+value:
                    return False
    
            return True
    
        def get_next(self, x, y):  # 得到下一个未填项
            for next_soulu in range(y + 1, 9):
                if self.b[x][next_soulu] == 0:
                    return x, next_soulu
            for row_n in range(x + 1, 9):
                for col_n in range(0, 9):
                    if self.b[row_n][col_n] == 0:
                        return row_n, col_n
            return -1, -1  # 若无下一个未填项,返回-1
    
        def try_it(self, x, y):  # 主循环
            if self.b[x][y] == 0:
                for i in range(1, 10):  # 从1到9尝试
                    self.t += 1
                    if self.check(x, y, i):  # 符合 行列宫均无条件 的
                        self.b[x][y] = i  # 将符合条件的填入0格
                        next_x, next_y = self.get_next(x, y)  # 得到下一个0格
                        if next_x == -1:  # 如果无下一个0格
                            return True  # 返回True
                        else:  # 如果有下一个0格,递归判断下一个0格直到填满数独
                            end = self.try_it(next_x, next_y)
                            if not end:  # 在递归过程中存在不符合条件的,即 使try_it函数返回None的项
                                self.b[x][y] = 0  # 回朔到上一层继续
                            else:
                                return True
        def start(self):
            begin = datetime.datetime.now()
            if self.b[0][0] == 0:
                self.try_it(0, 0)
            else:
                x, y = self.get_next(0, 0)
                self.try_it(x, y)
            for i in self.b:
                print(i)
            end = datetime.datetime.now()
            print('cost time: ', end - begin)
            print('times: ', self.t)
            return
    s = fill_sudoku(sudoku2)
    s.start()
    点赞 1 评论

相关推荐