Databases
StackOverflow2013
Postsdbo
POThe Dancing Links Algorithm - An explanation that is less explanatory but more on implementation?
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POThe Dancing Links Algorithm - An explanation that is less explanatory but more on implementation?
    primarykey
    data
    text
    <p>I've been working on a Sudoku Solver, my current solver uses the backtracking algorithm but it still takes too long.</p> <p>I'm hoping to get it down to less than a second for most cases. As such, I've decided to rewrite it with the dancing links algorithm, understanding it is one of the better bruteforce methods that works well especially with a constraint problem such as the Sudoku Puzzle.</p> <p>I have tried to read the Wiki and <a href="http://www.ocf.berkeley.edu/~jchu/publicportal/sudoku/0011047.pdf" rel="noreferrer">Knuth's paper</a> on it, however both of them are kinda hard to comprehend and extremely verbose.</p> <p>I also read Sudopedia's version on it, and it seems that once it got to the Sudoku's implementation, it got too abstract.</p> <p>Can someone try to explain the Dancing Links algorithm not in terms of its derivation but its implementation? (would be great to use the Sudoku as an example)</p> <p>Thanks!</p>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USMizipzor
    1. USnubela
    plurals
    1. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POThe Dancing Links Algorithm - An explanation that is less explanatory but more on implementation?
      1. USVinko Vrsalovic
      1. VTFavorite
    2. VO
      singulars
      1. POThe Dancing Links Algorithm - An explanation that is less explanatory but more on implementation?
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POThe Dancing Links Algorithm - An explanation that is less explanatory but more on implementation?
      1. USpnkfelix
      1. VTFavorite
    1. COSee also: http://stackoverflow.com/questions/1518346/
      singulars
      1. POThe Dancing Links Algorithm - An explanation that is less explanatory but more on implementation?
      1. USJonathan Leffler
    2. COWell then I will guess that this should help you: [A Sudoku Solver in Java implementing Knuth's Dancing Links Algorithm](http://www.ocf.berkeley.edu/~jchu/publicportal/sudoku/sudoku.paper.html)
      singulars
      1. POThe Dancing Links Algorithm - An explanation that is less explanatory but more on implementation?
      1. USKyle Rozendo
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload