# Number of knight's tours

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?

-
 There's a lot to be found on the knight's tour via Google. For a start try Bounds on the number of knight’s tours. – Peter Phipps Jul 28 '12 at 17:35