arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2410.17873math.OC
收藏

求解高维 n 皇后问题

Solving the n-Queens Problem in Higher Dimensions

Tim Kunt

AI总结:

本文针对高维 n 皇后问题提出整数规划模型及有效不等式强化方法,计算时间较现有基准加速 15-70 倍,并证明了多个大规模实例的最优性,同时讨论了可达到最优的启发式构造方法。

摘要:

在一个规模为 n 的 d 维棋盘上,最多可以放置多少个互不攻击的皇后?高维 n 皇后问题是著名的 n 皇后问题的推广。我们提出了高维 n 皇后问题的整数规划模型,并通过附加有效不等式进行了若干强化。与最近的基准相比,我们在所有整数规划实例上的计算时间实现了 15-70 倍的加速。我们的计算结果证明了若干大规模实例的最优性证书。利用所提出的方法,进一步打破此前未解决的实例是可能的。在对偶侧之外,我们还在原始侧讨论了构造解的启发式方法,这些解在与整数规划结果比较时被证明是最优的。

英文摘要:

How many mutually non-attacking queens can be placed on a d-dimensional chessboard of size n? The n-queens problem in higher dimensions is a generalization of the well-known n-queens problem. We present an integer programming formulation of the n-queens problem in higher dimensions and several strengthenings through additional valid inequalities. Compared to recent benchmarks, we achieve a speedup in computational time between 15-70x over all instances of the integer programs. Our computational results prove optimality of certificates for several large instances. Breaking additional, previously unsolved instances with the proposed methods is likely possible. On the primal side, we further discuss heuristic approaches to constructing solutions that turn out to be optimal when compared to the IP.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑