N-queens problem/dlx go: Difference between revisions

N-queens problem/dlx go (view source)

29 bytes added , 11 months ago

no edit summary

86

edits

Revision as of 20:31, 2 July 2018 (view source) rosettacode>Dchapes (Go dlx package to be used by multiple task solutions.)		Latest revision as of 04:40, 21 June 2023 (view source) Katsumi a.k.a. Upperdecker2562 (talk \| contribs) No edit summary
(One intermediate revision by one other user not shown)
Line 10: =={{header\|Go}}== <~~lang~~syntaxhighlight 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 }</~~lang~~syntaxhighlight>