Bounds on the number of knightʹs tours Original Research Article

Knightʹs tours are a fascinating subject. New lower bounds on the number of knightʹs tours and structured knightʹs tours on n × n chessboards and even n are presented. For the natural special case n = 8 a new upper bound is proved.