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