On the number of open knight's tours
classification
🧮 math.CO
keywords
knightnumberopentourscomputationcountinginternetproblem
read the original abstract
We review the state of the art in the problem of counting the number open knight tours, since the publication in internet of a computation of this quantity.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.