论文标题
巡回赛以及封闭骑士旅行的快速一代和混淆
Tourneys and the Fast Generation and Obfuscation of Closed Knight's Tours
论文作者
论文摘要
通过生成骑士图的顶点 - 偶发周期盖并加入由此产生的周期，可以获得生成封闭骑士旅行的新算法。实验表明，这些算法在实践中的速度明显快于以前的方法。还提供了一种封闭骑士旅行的快速混淆算法，该算法掩盖了其发电方法所产生的明显人工制品，以及其功效的视觉和统计证据。
New algorithms for generating closed knight's tours are obtained by generating a vertex-disjoint cycle cover of the knight's graph and joining the resulting cycles. It is shown experimentally that these algorithms are significantly faster in practice than previous methods. A fast obfuscation algorithm for closed knight's tours that obscures obvious artifacts created by their method of generation is also given, along with visual and statistical evidence of its efficacy.
