CentralNotice From Wikipedia, the free encyclopedia Jump to: navigation , search Play media The Dancing Links algorithm solving a polycube puzzle In computer science , Dancing Links , also known as DLX , is the technique suggested by Donald Knuth to efficiently implement his Algorithm X . [ 1 ] 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 Dancing Links comes from the way the algorithm works, as iterations of the algorithm cause the links to "dance" with partner links so as to resemble an "exquisitely choreographed dance." Knuth credits Hiroshi Hitotsumatsu and Kōhei Noshita with having invented the idea in 1979, [ 2 ] but it is his paper which has popularized it. ...