aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data commit

Browse source
This commit is contained in:
Ingy döt Net 2023-07-01 11:58:00 -04:00
parent 7387c8f97b
commit cb5bb5e222
199093 changed files with 3378972 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

58
Task/N-queens-problem/M2000-Interpreter/n-queens-problem.m2000 Normal file
View file

@ -0,0 +1,58 @@
Module N_queens {
Const l = 15 'number of queens
Const b = False 'print option
Dim a(0 to l), s(0 to l), u(0 to 4 * l - 2)
Def long n, m, i, j, p, q, r, k, t
For i = 1 To l: a(i) = i: Next i
For n = 1 To l
m = 0
i = 1
j = 0
r = 2 * n - 1
Do {
i--
j++
p = 0
q = -r
Do {
i++
u(p) = 1
u(q + r) = 1
Swap a(i), a(j)
p = i - a(i) + n
q = i + a(i) - 1
s(i) = j
j = i + 1
} Until j > n Or u(p) Or u(q + r)
If u(p) = 0 Then {
If u(q + r) = 0 Then {
m++ 'm: number of solutions
If b Then {
Print "n="; n; "m="; m
For k = 1 To n {
For t = 1 To n {
Print If$(a(n - k + 1) = t-> "Q", ".");
}
Print
}
}
}
}
j = s(i)
While j >= n And i <> 0 {
Do {
Swap a(i), a(j)
j--
} Until j < i
i--
p = i - a(i) + n
q = i + a(i) - 1
j = s(i)
u(p) = 0
u(q + r) = 0
}
} Until i = 0
Print n, m 'number of queens, number of solutions
Next n
}
N_queens