Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Does Money Buy Happiness? Evidence from Twins in Urban China
This paper estimates the effect of income on individual self-reported happiness using unique Chinese twins data. We address three… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2013
2013
Enhanced LSB image steganography method 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… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2010
2010
A multi-scale triangular mapping and its applications in variation scale scrambling
A multi-scale triangular mapping and its inverse mapping are presented. Combined with an mton mapping, scrambling method based on… Expand
  • table 1
  • table 2
  • figure 3
  • table 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Paper-based and computer-based concept mappings: The effects on computer achievement, computer anxiety and computer attitude
The purpose of this paper is to compare the effects of paper-based and computer-based concept mappings on computer hardware… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2008
2008
Modeling recursion data structures for FPGA-based implementation
Recursion is a powerful technique used to solve problems with repeating patterns, and is a fundamental structure in software. To… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Which Chessboards have a Closed Knight's Tour within the Cube?
  • Joe DeMaio
  • Electron. J. Comb.
  • 2007
    • Corpus ID: 2046574
A closed knight's tour of a chessboard uses legal moves of the knight to visit every square exactly once and return to its… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Generalized knight's tours on rectangular chessboards
In [Math. Mag. 64 (1991) 325-332], Schwenk has completely determined the set of all integers m and n for which the m × n… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Social identification effects in social dilemmas: a transformation of motives
Three experimental studies were conducted to examine two alternative explanations for the widely established positive eAect of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1997
1997
Bounds on the Number of Knight's Tours
Knight’s tours are a fascinating subject. New lower bounds on the number of knight’s tours and structured knight’s tours on n x… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1981
1981
The Knight's tour
The purpose of this project is to explore all the possible moves that the Knight (chess piece) can move in an nxn board. This is… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE