Main Article Content
Let m, n be odd integers such that m, n 3, the ring boards (m, n, 1) is an m x n chessboard with the middle part of size 1 x 1 is missing. This article studies the conditions to guarantee the existence of a closed knight’s tour on the ring board (n, n, 1) and the ring board (m, m+4k, 1) for odd integers m such that m 11 and k 0 and if it exists, then an algorithm for finding a closed knight’s tour on that board is given.
 Schwenk, A.L. (1991). Rectangular chessboards have a knight’s tour, Math. Magazine, 64, p.325-332.
 Wiitala, H.R. (1996). The knight’s tour problem on boards with holes, Research Experiences for Undergraduates Proceedings, p.132-151.