N-queens problem: Difference between revisions
m
→Python: Niklaus Wirth algorithm: Revised one sentence
m (→Python: Niklaus Wirth algorithm: Removed redundant (duplicate) example.) |
m (→Python: Niklaus Wirth algorithm: Revised one sentence) |
||
Line 12,841:
for solution in queens(8, 0, [], [], []):
print(solution)</syntaxhighlight>
The algorithm can be easily improved by using sets instead of lists and by avoiding the time- and space-consuming implicit copy operations during recursion. On a regular 8x8 board only 5,508 possible queen positions are examined.
<syntaxhighlight lang="python">def queens(n: int):
| |||