【摘要】 舞蹈链是一种用特殊的数据结构来实现的X算法,主要用来解决精确覆盖问题,并在求解问题上表现出非常优越的性能。用舞蹈链求解数独,是将数独问题按特定的规则转化为精确覆盖问题后再进行求解。通过对问题转化和求解过程的原理解析,使读者加深对舞蹈链算法的理解。结合数独的特性和人工求解策略对算法进行优化,可以更好地提高算法的效率。更多还原

【Abstract】 Dancing links is a special data structure to achieve the X algorithm, which is mainly used to solve the exact cover problem with superior performance. Solving sudoku with dancing links is to transform the sudoku problem into an exact cover problem according to specific rules and then solve the latter. Through an analysis of the problem transformation and the principle of solution process, we deepen the understanding of the dancing links algorithm. Combination with the characteristics of sudoku and manual solution strategy to optimize the algorithm can better improve the efficiency of the algorithm.更多还原