Tourneys and the Fast Generation and Obfuscation of Closed Knight's Tours

arXiv2001.06044MaRDI QIDQ6333005

Publication date: 16 January 2020

Abstract: 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.

Has companion code repository: https://github.com/Ian-Parberry/Tourney

This page was built for publication: Tourneys and the Fast Generation and Obfuscation of Closed Knight's Tours

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6333005)