✦ LIBER ✦

An efficient algorithm for the Knight's tour problem

✍ Scribed by Ian Parberry

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 715 KB
Volume: 73
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(96)00010-8

No coin nor oath required. For personal study only.

✦ Synopsis

It is easy to see that there is no closed knight's tour when n is odd since such a board has one more white square than black, or vice versa, and since the colours of the squares visited on a knight's tour must alternate.

📜 SIMILAR VOLUMES

An Efficient Algorithm for the Complex R

An Efficient Algorithm for the Complex Roots Problem

✍ C.Andrew Neff; John H. Reif 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 406 KB

Given a univariate polynomial f (z) of degree n with complex coefficients, whose norms are less than 2 m in magnitude, the root problem is to find all the roots of f (z) up to specified precision 2 ϪȐ . Assuming the arithmetic model for computation, we provide an algorithm which has complexity O(n l

An efficient algorithm for the “stable r

An efficient algorithm for the “stable roommates” problem

✍ Robert W Irving 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 938 KB

An efficient algorithm for the 3-satisfi

An efficient algorithm for the 3-satisfiability problem

✍ Alain Billionnet; Alain Sutter 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 543 KB

An efficient algorithm for solving the v

An efficient algorithm for solving the vibronic coupling problem

✍ K.P Lawley 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 855 KB

An efficient algorithm for solving the d

An efficient algorithm for solving the discrete minisum problem

✍ Roland Hornung 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 302 KB

An efficient algorithm for the single ma

An efficient algorithm for the single machine tardiness problem

✍ Suna Kondakci; Ömer Kirca; Meral Azizoǧlu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 553 KB