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

Related topics

Related topics

10 relations
Artificial neuronBrute-force searchComputer scienceDegree (graph theory)
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Enhanced LSB Image Steganography Method By Using Knight Tour Algorithm, Vigenere Encryption and LZW Compression
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 Closed Knight Tour Problem in Higher Dimensions
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
How good is the Warnsdorff's knight's tour heuristic?
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
Which Chessboards have a Closed Knight's Tour within the Cube?
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
Generalized Knight's Tour Problem and Its Solutions Algorithm
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
Heuristic Strategies for the Knight Tour Problem
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
The knight's tour - evolutionary vs. depth-first search
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
An Efficient Algorithm for the Knight's Tour Problem
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
Scalability of a neural network for the knight's tour problem
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
Neural networks computing for knight's tour problems
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?