|
%I #26 Mar 07 2021 18:51:43
%S 0,0,0,4,8,12,24,32,42,54
%N Length of maximal uncrossed cycle of knight moves on n X n board.
%C I had computed the values for n up to 8 long ago and reported them in a letter to the editor of the Journal of Recreational Mathematics 2 (1969), 155-157. The values for n=9 and n=10 are new, found using ZDDs.
%C For best known results see link to Alex Chernov's site. - _Dmitry Kamenetsky_, Mar 02 2021
%D D. E. Knuth, Selected Papers on Fun and Games. CSLI, Stanford, CA, 2010. (CSLI Lecture Notes, vol. 192)
%H Alex Chernov, <a href="http://ukt.alex-black.ru/">Uncrossed Knight's Tours</a>.
%e Lengths of longest uncrossed knight cycles on all sufficiently small rectangular boards m X n, with 3 <=m <= n:
%e ......0...0...4...6...6...6...6..10
%e ..........4...6...8..10..12..14..16
%e ..............8..12..14..18..20..22
%e .................12..18..22..24..28
%e .....................24..26..32..36
%e .........................32..36..42
%e .............................42..50
%e .................................54
%Y Cf. A003192.
%K nonn,more,hard
%O 1,4
%A _Don Knuth_, Jun 24 2010
%E a(1)=a(2)=a(3)=0 prepended by _Max Alekseyev_, Jul 17 2011
| 