RosettaCodeData/Task/N-queens-problem/Frink/n-queens-problem.frink
2020-02-17 23:21:07 -08:00

12 lines
284 B
Text

solution[board] :=
{
for q = 0 to length[board] - 1
for c = q+1 to length[board] - 1
if board@q == board@c + (c - q) or board@q == board@c - (c - q)
return false
true
}
for b = array[1 to 8].permute[]
if solution[b]
println[b]