This blog post discusses a paper “Odd king tours …” written with Michael Fourte (a CS undergrad at the time, now is a lawyer and Naval officer in NYC) in 1997. It was published in the now defunct *Journal of Recreational Mathematics*, issue 31(3), in 2003.

In the paper, we showed that there is no complete odd king tour on an even chessboard, partially answering a question raised in [BK], [S]. This post surveys that paper.

King moves on an 8×8 board.

A complete king tour on an board may be represented graph theoretically as a Hamiltonian cycle on a particular graph with vertices, of which of them have degree , have degree and the remaining vertices have degree . The problem of finding an algorithm to find a hamiltonian circuit in a general graph is known to be NP complete. The problem of finding an efficient algorithm to search for such a tour therefore appears to be very hard problem. In [BK], C. Bailey and M. Kidwell proved that complete even king tours do not exist. They left the question of the existence of complete odd tours open but showed that if they did exist then it would have to end at the edge of the board.

We shall show that

**Theorem:** *No complete odd king tours exist on an board, except possibly in the following cases:*

* and ,*
*, and or (or both) is odd,*
*, and the tour is “rapidly filling”.*

The definition of “rapidly filling” requires some technical notation and will be given later.

**Background**

Before proving this, we recall briefly some definitions and results from [BK] which we shall use in our proof.

Definition: Two squares are called a **neighbor pair** if they have a common edge or common vertex. A neighbor pair is called **completed** if both squares have been visited by the the king at some point in a tour, including the case where the king is still on one of the squares. A **foursome** is a collection of four squares which form a array of neighboring squares on the board. A foursome is called **completed** if all four squares have been visited by the the king at some point in a tour, including the case where the king is still on one of the four squares.

Unless stated otherwise, after a given move of a given odd king tour, let denote the change in the number of completed foursomes and let denote the change in the number of completed neighbor pairs. Note that is equal to the total number of previously visited squares which are neighboring the king.

The following result was proven in [BK] using a counting argument.

**Lemma:**

*The number of neighbor pairs of an board is *
*(b) The number of foursomes of an board is *

The following result was proven in [BK] using a case-by-case argument:

**Lemma:** *After a particular move in a given even king tour, let denote the change in the number of completed foursomes and let denote the change in the number of completed neighbor pairs. If then . If then . If then . If then . *

We shall need the proof of this lemma (for which we refer the reader to [BK]) rather than the lemma itself. The proof of this lemma implies the following:

**Lemma:** *For an odd king tour: If then . If then . If then . If then . *

The proof is omitted.

**Definition:** We call an odd king tour **rapidly filling** if there is a move in the tour such that and .

**The proof of the theorem**

**Proposition:** *If and are both even then no complete odd king tour exists.*

**proof**: Let denote the total number of completed neighbor pairs after a given point of a given odd king tour. We may represent the values of as a sequence of numbers, . Here is the total number of completed neighbor pairs after the first move, for after the second move, and so on. Each time the king moves, $N$ must increase by an odd number of neighbors – either , , , or . In particular, the parity of alternates between odd and even after every move. If and are both even and if a complete odd king tour exists then the the final parity of must be odd. By the lemma above, the value of after any complete king tour is , which is obviously even. This is a contradiction. **QED**

It therefore suffices to prove the above theorem in the case where at least one of is odd. This follows from a computer computation, an argument from Sands [Sa], and the sequence of lemmas that follow. The proofs are in the original paper, and omitted.

Let denote the total number of completed neighbor pairs in a given odd king tour. Let denote the number of completed foursomes in a given odd king tour. Let $M$ denote the number of moves in a given odd king tour. Let

**Lemma:** *Let , where are defined as above. Then equals , , , or . If the tour is not rapidly filling then only occurs when .*

**Lemma:** *Let denote the largest number of non-overlapping blocks which will fit in the board. There are no labelings of the checkerboard by ‘s and ‘s with no blocks of ‘s and fewer than ‘s. In particular, if there are no blocks of 1’s then there must be at least 0’s.*

We conclude with a question. An odd king tour of length on an board will be called **nearly complete**. *Which boards have nearly complete odd king tours?* We **conjecture**: *If then all boards have nearly complete odd king tours.*

**References**

[BK] C. Bailey, M. Kidwell, “A king’s tour of the chessboard”, Math. Mag. 58(1985)285-286

[S] S. Sacks, “odd and even”, Games 6(1982)53.

[Sa] B. Sands, “The gunport problem”, Math. Mag. 44(1971)193-194.

You must be logged in to post a comment.