https://blog.khzaw.dev/tags/algorithms/Recent content in Algorithms on khzHugoen-usFri, 12 Feb 2016 00:00:00 +0800https://blog.khzaw.dev/posts/finding-a-knights-tour/Fri, 12 Feb 2016 00:00:00 +0800https://blog.khzaw.dev/posts/finding-a-knights-tour/<figure><img src="https://blog.khzaw.dev/img/chess-knight_hu_dc022dd327205ba2.webp" alt="" loading="lazy" decoding="async" width="1024" height="685"></figure> <p>A Knight&rsquo;s Tour is a sequence of moves done by a knight on a chessboard such that it visits each and every square exactly once. Subsequently, the objective of <a href="https://en.wikipedia.org/wiki/Knight%27s_tour">the Knight&rsquo;s Tour problem</a> is to determine whether there exists a Knight&rsquo;s Tour from a given starting position. In graph theory terms, it is a form of Hamiltonian path where you visit each vertex of the graph exactly once along the path. Tours can also be <strong>cyclic</strong> or <strong>closed</strong> if the final square is a knight&rsquo;s move away from the first and <strong>acyclic</strong> or <strong>open</strong> otherwise.</p>