BWhat changed
A structured dancing-links implementation applies reversible removal/restoration to exact-cover backtracking and organizes changing constraints efficiently.
Scientific scope
A structured dancing-links implementation applies reversible removal/restoration to exact-cover backtracking and organizes changing constraints efficiently. This is a search implementation technique, not a polynomial-time algorithm for general exact cover. The opening credits Hitotumatu and Noshita's earlier use of reversible list operations.
Evidence
Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.
Contributors
- Donald E. Knuth · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction