跳舞的链接算法 - 这是少解释，但更多的执行问题的解释？ [英] The Dancing Links Algorithm - An explanation that is less explanatory but more on implementation?

问题描述

我一直工作在一个数独解算器，我现在的解算器采用回溯算法，但它仍然需要太长的时间。

I've been working on a Sudoku Solver, my current solver uses the backtracking algorithm but it still takes too long.

我希望得到它下降到不到一秒钟在大多数情况下。因此，我决定与舞蹈链算法重写它，理解它是一个更好暴力破解的方法与约束问题的工作很好，特别是诸如数独谜题之一。

I'm hoping to get it down to less than a second for most cases. As such, I've decided to rewrite it with the dancing links algorithm, understanding it is one of the better bruteforce methods that works well especially with a constraint problem such as the Sudoku Puzzle.

我试图阅读维基和 Knuth的纸就可以了，但是他们两个人都有点难以COM prehend和非常详细。

I have tried to read the Wiki and Knuth's paper on it, however both of them are kinda hard to comprehend and extremely verbose.

我也看了Sudopedia的版本就可以了，似乎一旦到了数独的实现，它得到了过于抽象。

I also read Sudopedia's version on it, and it seems that once it got to the Sudoku's implementation, it got too abstract.

可有人试图解释跳舞链接算法不在其推导，但其实施的条件？ （将是巨大的使用数独作为一个例子）

Can someone try to explain the Dancing Links algorithm not in terms of its derivation but its implementation? (would be great to use the Sudoku as an example)

谢谢！

推荐答案

那好吧，我会想，这应该帮助你：

Well then I will guess that this should help you:

数独解算器在Java中实现Knuth的舞蹈链算法

这篇关于跳舞的链接算法 - 这是少解释，但更多的执行问题的解释？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！