The Dancing Links algorithm solving a polycube puzzle In computer science, dancing links (DLX) is a technique for adding and deleting a node from a circular doubly linked list. It is particularly useful for efficiently implementing backtracking algorithms, such as Knuth's Algorithm X for the exact cover problem.[1] Algorithm X is a recursive, nondeterministic, depth-first, backtracking algorithm t
![Dancing Links - Wikipedia](https://cdn-ak-scissors.b.st-hatena.com/image/square/b935e5c5d11fe932c1f2fb12f8fbb9bc6ae71cc5/height=288;version=1;width=512/https%3A%2F%2Fupload.wikimedia.org%2Fwikipedia%2Fcommons%2Fthumb%2Fb%2Fb6%2FDancing_links_Quantumino_puzzle.ogv%2F496px--Dancing_links_Quantumino_puzzle.ogv.jpg)