Revision as of 19:45, 9 July 2023 (view source) Lader (talk \| contribs) (→‎{{header\|Maxima}}) ← Older edit		Revision as of 18:05, 10 July 2023 (view source) Lader (talk \| contribs) (→‎{{header\|Maxima}}) Newer edit →
Line 8,850: <syntaxhighlight lang="maxima"> /* Inspired by code from Python */ Queens(N):=block([K,C,P,V~~,A,S~~,L:[]], C: makelist(K,K,1,N), P: permutations(C), for V in P do ( A:if is(N=length(unique(makelist(V[K]+K, K, C))),) then ( S: if is(N=length(unique(makelist(V[K]-K, K, C))),) then ( if ~~is(A=N)~~ ~~and~~ ~~is(S=N)~~ ~~then~~ L: ~~cons~~endcons(V, L) ) ) ), L )$ Queens(8);length(%);</syntaxhighlight>

N-queens problem: Difference between revisions

N-queens problem (view source)