计数$N$皇后
Counting $N$ Queens
AI总结:
本文针对经典N皇后解的计数问题,提出基于洛伦兹曲线分位数重排序的蒙特卡洛方法,证明其为高效多项式时间解,还介绍多种其他MC方法及二元矩阵采样算法。
摘要:
高斯提出了枚举在$N\ imes N$棋盘上放置$N$个皇后、且任意两个皇后互不攻击的解的数量的问题。N皇后问题是组合数学中的经典问题。本文描述了多种用于计数解的数量的蒙特卡洛(Monte Carlo, MC)方法。具体而言,我们提出了一种基于与解的数量计数相关的和的洛伦兹曲线的分位数重排序方法。我们证明该方法可得到高效的多项式时间解。其他MC方法包括垂直似然蒙特卡洛、重要性采样、切片采样、模拟退火、能级采样和嵌套采样。可通过Swendsen-Wang风格算法对标识棋盘上皇后位置的二元矩阵进行采样。我们的蒙特卡洛方法可在多项式时间内计数解的数量。
英文摘要:
Gauss proposed the problem of how to enumerate the number of solutions for placing $N$ queens on an $N\times N$ chess board, so no two queens attack each other. The N-queen problem is a classic problem in combinatorics. We describe a variety of Monte Carlo (MC) methods for counting the number of solutions. In particular, we propose a quantile re-ordering based on the Lorenz curve of a sum that is related to counting the number of solutions. We show his approach leads to an efficient polynomial-time solution. Other MC methods include vertical likelihood Monte Carlo, importance sampling, slice sampling, simulated annealing, energy-level sampling, and nested-sampling. Sampling binary matrices that identify the locations of the queens on the board can be done with a Swendsen-Wang style algorithm. Our Monte Carlo approach counts the number of solutions in polynomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。