随机拉丁方和数独设计生成
Random Latin squares and Sudoku designs generation
摘要:
拉丁方的均匀随机生成是一个经典问题。在本文中,我们证明了拉丁方和数独设计是适当定义的图的最大团。我们已经开发了一个简单的算法,均匀随机抽样的拉丁方和数独设计。它利用最新的图形分析工具。相应的SAS代码见附件。
英文摘要:
Uniform random generation of Latin squares is a classical problem. In this paper we prove that both Latin squares and Sudoku designs are maximum cliques of properly defined graphs. We have developed a simple algorithm for uniform random sampling of Latin squares and Sudoku designs. It makes use of recent tools for graph analysis. The corresponding SAS code is annexed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。