Knight's tour

Known as: H. C. Warnsdorff, Schwenk's theorem, Knights tour 
A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square only once. If the knight ends on a square… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
The challenge of steganographic methods is to create a rational balance between the quality of the file and the size of data that… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2012
2012
The problem of existence of closed knight tours for rectangular chessboards was solved by Schwenk in 1991. Last year, in 2011… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Warnsdorff's rule for a knight's tour is a heuristic, i.e., it's a rule that does not produce the desired result all the time. It… (More)
Is this relevant?
2007
2007
A closed knight’s tour of a chessboard uses legal moves of the knight to visit every square exactly once and return to its… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Knight's tour matrix, the solution of knight's tour problem (KTP), can be applied to digital image information security. Inspired… (More)
  • table 9
Is this relevant?
2004
2004
This paper presents three heuristic functions that aim to reduce the search cost for the knight tour problem. The first heuristic… (More)
  • figure 1
  • figure 3
  • figure 4
  • table 1
  • figure 5
Is this relevant?
2004
2004
A genetic algorithm is used to find solutions to the standard 8/spl times/8 knight's tour problem, and its performance is… (More)
  • figure 4
  • figure 8
  • figure 6
  • figure I
  • figure 11
Is this relevant?
1997
1997
A knight’s tour is a series of moves made by a knight visiting every square of an n x n chessboard exactly once. The knight’s… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1996
1996
The e ectiveness and e ciency of a Hop eld style neural network recently proposed by Takefuji and Lee for the knight s tour… (More)
Is this relevant?
1992
1992
Ta.kefuji, Y. and K.C. Lee, Neural network computing for knight's tour problems, Neurocomputing 4 (1992) 249-254. This paper… (More)
  • figure 1
  • figure 3
  • figure 7
  • figure 8
  • figure 10
Is this relevant?