Tell me more ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
up vote 0 down vote favorite

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?

share|improve this question
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

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.