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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
