Dancing Links
In computer science, dancing links is the technique suggested by Donald Knuth to efficiently implement his Algorithm X. Algorithm X is a recursive, nondeterministic, depth-first, backtracking algorithm that finds all solutions to the exact cover problem. Some of the better-known exact cover problems include tiling, the n queens problem, and Sudoku.
Wikipage redirect
primaryTopic
Dancing Links
In computer science, dancing links is the technique suggested by Donald Knuth to efficiently implement his Algorithm X. Algorithm X is a recursive, nondeterministic, depth-first, backtracking algorithm that finds all solutions to the exact cover problem. Some of the better-known exact cover problems include tiling, the n queens problem, and Sudoku.
has abstract
In computer science, dancing l ...... aper which has popularized it.
@en
Tanz der Kanten ist eine Techn ...... der exakten Überdeckung lösen.
@de
在 计算机科学 中, Dancing Links ,舞蹈链, ...... a 在1979的研究 , 但是Knuth的论文让舞蹈链流行。
@zh
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
693,033,665
hypernym
type
comment
In computer science, dancing l ...... n queens problem, and Sudoku.
@en
Tanz der Kanten ist eine Techn ...... chts := B;B.rechts.links := B;
@de
在 计算机科学 中, Dancing Links ,舞蹈链, ...... a 在1979的研究 , 但是Knuth的论文让舞蹈链流行。
@zh
label
Dancing Links
@en
Tanz der Kanten
@de
舞蹈链
@zh