Dancing Links

Knuth, D. E. (2000). Dancing Links. Millennial Perspectives in Computer Science.

Type

Preprint

Intellectual base

Grey literature

Year

2000

Link

https://arxiv.org/abs/cs/0011047

Cited from

computer_science

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Backtracking
  • Combinatorial puzzles — number-placement puzzles, the n-queens problem, and graph colouring are classic backtracking-solvable problems, with the same algorithm regardless of the puzzle.

    This sourcePresents efficient backtracking for exact-cover and constraint-satisfaction problems (n-queens, number-placement grids) via the Algorithm X / DLX scheme.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:1fb1bc37c0fe · see in the full table