N-queens problem/dlx go: Difference between revisions

no edit summary
m (Avoid miscounting task entries twice)
No edit summary
 
Line 9:
* [[Sudoku]]
 
=={{header|Go}}==
<span style='font-family: "Linux Libertine",Georgia,Times,serif;font-size:150%;'>[[Go]]</span><hr>
<langsyntaxhighlight Golang="go">// Package dlx is an implementation of Knuth's Dancing Links for algorithm X
// to solve a generalized cover problem.
//
Line 310:
}
c.right.left, c.left.right = &c.x, &c.x
}</langsyntaxhighlight>