On a general framework for large-scale constraint-based optimization
On a general framework for large-scale constraint-based optimization
复制标题
大规模基于约束的优化的通用框架
DOI：
10.1145/122319.122323
复制
发表时间：
1991
期刊：
影响因子：
--
通讯作者：
J. Gu
中科院分区：
文献类型：
--
作者：
J. Gu
Bo Bernhardsson [2]的一封信中提到的n皇后问题的显式解基本上是Ahrens分析的Pauls解（见我们在SIGART 1990年10月号上的前一篇文章的参考文献[1]）。其成果早在1918年（而不是1969年）之前就已进入公共领域。我们也提到了它的弱点，即：解析方法提供的解的类别是非常有限的，正如Ahrens在[1]中指出的。它们只能为n皇后问题提供一个解，而不能提供任何解（存在n皇后问题的更好的显式解）。对于原则上可以找到任何解的搜索方法，情况并非如此。这种区别对于n皇后问题的实际应用至关重要。
The explicit solution for the n–queens problem, mentioned in a letter from Bo Bernhardsson [2], is basically Pauls's solution analyzed by Ahrens (See reference [1] of our previous article in SIGART October issue 1990). The result was in public domain long before 1918 (not 1969). We also mentioned its weakness, namely: The class of solutions provided by analytical methods is very restricted, as Ahrens pointed out in [1]. They can only provide one solution for the n–queens problem and can not provide any solution (much better explicit solutions for the n–queens problem exist). This is not the case for search methods which can find, in principle, any solution. This distinction is crucial for practical applications of the n-queens problem.