The following question raised to my mind when I was thinking another problem.
Let $f(n)$ denote the number of knight's tours on the $n \times n$-board. What can we say about its asymptotic behavior, in Landau's or Fedja's notation?
Sign up using Google
Sign up using Facebook
Sign up using Stack Exchange
By posting your answer, you agree to the
terms of service.
10 months ago