An Efficient Algorithm for the Generalized (1,k)-Knight's Tours Problem

Knightpsilas tours are a fascinating subject. In [Discrete Appl. Math 150 (2005) 80-98], G.L.Chia and Siew-Hui Ong have presented generalized knightpsilas tours problem for the first time. In this paper, (i) we research the least chessboard (defined in Section 2) of (a,b)-knightpsilas tours (Section 3). (ii) we present an algorithm to (1,k)-knightpsilas tours which runs in O(nm) (Section 4).