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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
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
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… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
2010
2010
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
2007
2007
  • J. 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
2004
2004
This paper presents three heuristic functions that aim to reduce the search cost for the knight tour problem. The first heuristic… Expand
  • figure 1
  • figure 3
  • figure 4
  • table 1
  • figure 5
Highly Cited
2001
Highly Cited
2001
Abstract The present paper outlines the philosophical background as well as a practical case of so-called decentralized… Expand
  • table 1
  • table 2
Highly Cited
1999
Highly Cited
1999
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
1997
1997
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
Highly Cited
1997
Highly Cited
1997
  • I. Parberry
  • Discret. Appl. Math.
  • 1997
  • Corpus ID: 206026649
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
1990
1990
Abstract Observations during the laying period and after hatching showed that nest defence by merlins varied from fierce attacks… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • table I