Peaceful chess queen armies: Difference between revisions
→{{header|ATS}}
Line 314:
The program also can stop after printing a specified number of solutions, although the default is to print all solutions.
(Commentary by the author: this program suffers similarly of slowness, in eliminating rotational equivalents, as does its Scheme ancestor. Some reasons: it uses backtracking and that is slow; it uses essentially the same inefficient storage format for solutions [one could for instance use integers], and it does not precompute rotational equivalents. However, it does satisfy the task requirements, and might be regarded as a good start. And it is can solve the m=5, n=6 case in practical time on a fast machine. m=7, n=7 is a more annoying case.)
<lang ats>(********************************************************************)
| |||