# Knight's tour

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

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)

Is this relevant?

2012

2012

- Electr. J. Comb.
- 2012

The problem of existence of closed knight tours for rectangular chessboards was solved by Schwenk in 1991. Last year, in 2011â€¦Â (More)

Is this relevant?

2008

2008

- ArXiv
- 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

- Electr. J. Comb.
- 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)

Is this relevant?

2006

2006

- International Conference on Computationalâ€¦
- 2006

Knight's tour matrix, the solution of knight's tour problem (KTP), can be applied to digital image information security. Inspiredâ€¦Â (More)

Is this relevant?

2004

2004

- IC-AI
- 2004

This paper presents three heuristic functions that aim to reduce the search cost for the knight tour problem. The first heuristicâ€¦Â (More)

Is this relevant?

2004

2004

- Proceedings of the Congress on Evolutionaryâ€¦
- 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)

Is this relevant?

1997

1997

- Discrete Applied Mathematics
- 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)

Is this relevant?

1996

1996

- Neurocomputing
- 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

- Neurocomputing
- 1992

Ta.kefuji, Y. and K.C. Lee, Neural network computing for knight's tour problems, Neurocomputing 4 (1992) 249-254. This paperâ€¦Â (More)

Is this relevant?