N-queens problem/dlx go: Difference between revisions
m
Avoid miscounting task entries twice
(Go dlx package to be used by multiple task solutions.) |
Thundergnat (talk | contribs) m (Avoid miscounting task entries twice) |
||
Line 9:
* [[Sudoku]]
<span style='font-family: "Linux Libertine",Georgia,Times,serif;font-size:150%;'>[[Go]]</span><hr>
<lang Go>// Package dlx is an implementation of Knuth's Dancing Links for algorithm X
// to solve a generalized cover problem.
| |||