ABSTRACT
Robert E. Parkin, in “Knight Interchanges” (J. Recreational Math., 7(2), Spring 1974, pp. 108-110) states that 26 is the minimum number of moves in the 6-Knight problem (Figure 3). (The problem is to interchange the positions of the black and the white knights using the usual knight moves and not allowing more than one knight on a square at a time.) I have found an 18-move solution: https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781315224169/bc8ae104-41e9-4605-a352-2689f2cb97f2/content/fig22_3.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/>
