title: The Dancing Links Algorithm - An explanation that is less explanatory but more on implementation?
body: <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>