Sudoku 数独问题(dfs)

最新推荐文章于 2020-12-31 14:01:43 发布

free-dancer

最新推荐文章于 2020-12-31 14:01:43 发布

阅读量374

点赞数

分类专栏： ACM- 搜索(DFS BFS)

本文链接：https://blog.csdn.net/Joined/article/details/76696630

版权

本文介绍了使用深度优先搜索(DFS)算法解决数独问题的方法，详细阐述了算法思路，并通过实例展示了如何通过DFS填充数独网格。

摘要由CSDN通过智能技术生成

Problem Description

Sudoku is a very simple task. A square table with 9 rows and 9 columns is divided to 9 smaller squares 3x3 as shown on the Figure. In some of the cells are written decimal digits from 1 to 9. The other cells are empty. The goal is to fill the empty cells with decimal digits from 1 to 9, one digit per cell, in such way that in each row, in each column and in each marked 3x3 subsquare, all the digits from 1 to 9 to appear. Write a program to solve a given Sudoku-task.

Input

The input data will start with the number of the test cases. For each test case, 9 lines follow, corresponding to the rows of the table. On each line a string of exactl