An Improved Method for Finding Knight Covers

Abstract

A two-step approach to finding knight covers for an $N\times N$ chessboard eliminates the problem of detecting duplicate partial solutions. The time and storage needed to generate solutions is greatly reduced. The method can handle boards as large as $45\times 45$ and has matched or beaten all previously known solutions for every board size tried.