说明：  在计算机科学，舞蹈链接，也被称为的DLx ，是技术建议唐纳德克努特有效地执行其算法十算法X是递归，随意性，深度优先，回溯算法，认为所有的解决方案的确切覆盖问题。一些较为著名的确切涵盖的问题包括瓦工，n皇后问题，数独。
(In computer science, Dancing Links, also known as DLX, 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.)