数独解谜技巧
Techniques for Solving Sudoku Puzzles
摘要:
解决数独谜题是世界上最受欢迎的消遣之一。谜题的难度从简单到非常具有挑战性;最难的谜题往往有最多的空单元。本文介绍并比较了数独问题的三种求解算法。回溯法、模拟退火法和交替投影法是求解组合最优化问题的常用方法。我们的结果支持回溯。它绝对正确地解决了数独难题或推断出一个唯一的解决方案不存在。然而,回溯在高维组合优化中不能很好地扩展。因此,让数学科学的学生在具体的环境中接触其他两种解决方法是有用的。模拟退火算法与马尔可夫链蒙特卡罗算法(MCMC)具有共同的结构,具有广泛的适用性.交替投影法解决了凸规划中的可行性问题。将离散最优化问题转换为连续的最优化问题开辟了处理更高维的组合问题的可能性。
英文摘要:
Solving Sudoku puzzles is one of the most popular pastimes in the world. Puzzles range in difficulty from easy to very challenging; the hardest puzzles tend to have the most empty cells. The current paper explains and compares three algorithms for solving Sudoku puzzles. Backtracking, simulated annealing, and alternating projections are generic methods for attacking combinatorial optimization problems. Our results favor backtracking. It infallibly solves a Sudoku puzzle or deduces that a unique solution does not exist. However, backtracking does not scale well in high-dimensional combinatorial optimization. Hence, it is useful to expose students in the mathematical sciences to the other two solution techniques in a concrete setting. Simulated annealing shares a common structure with MCMC (Markov chain Monte Carlo) and enjoys wide applicability. The method of alternating projections solves the feasibility problem in convex programming. Converting a discrete optimization problem into a continuous optimization problem opens up the possibility of handling combinatorial problems of much higher dimensionality.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。