2 citations · 3 across the 2 of their papers we have counts for
2 papers
math.CO2015★ 2 cited
On the number of open knight's tours
Héctor Cancela, Ernesto Mordecki
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.
math.PR2006★ 1 cited
Counting Knight's Tours through the Randomized Warnsdorff Rule
Héctor Cancela, Ernesto Mordecki
We give an estimate of the number of geometrically distinct open tours $\G$ for a knight on a chessboard. We use a randomization of Warnsdorff rule to implement importance sampling…