Dancing Links
id:
dancing-links-318-15528971
title:
Dancing Links
text:
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. 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. The name
brand slug:
wiki
category slug:
encyclopedia
description:
Programming technique on linked lists
original url:
https://en.wikipedia.org/wiki/Dancing_Links
date created:
date modified:
2023-06-10T12:24:48Z
main entity:
{"identifier":"Q2393251","url":"https://www.wikidata.org/entity/Q2393251"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/b/b6/Dancing_links_Quantumino_puzzle.ogv","width":496,"height":496}
fields total:
13
integrity:
15