Sign In

Login

Password

Forgot Password ? Sign Up

Knight's tour (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Knight's tour" in English language version.

refsWebsite
Global rank English rank
7doi.org
2nd place
2nd place
3semanticscholar.org
11th place
8th place
2wolfram.com
513th place
537th place
2web.archive.org
1st place
1st place
2ghostarchive.org
32nd place
21st place
2mayhematics.com
low place
low place
2books.google.com
3rd place
3rd place
1sjsu.edu
6,511th place
4,308th place
1archive.org
6th place
6th place
1iiitb.ac.in
low place
low place
1bridge-india.blogspot.com
low place
low place
1math.ca
low place
low place
1ams.org
451st place
277th place
1combinatorics.org
low place
low place
1core.ac.uk
1,734th place
1,312th place
1psu.edu
207th place
136th place
1github.com
383rd place
320th place
1uva.nl
3,518th place
2,652nd place

ams.org

mathscinet.ams.org

  • Löbbing, Martin; Wegener, Ingo (1996). "The number of knight's tours equals 33,439,123,484,294—counting with binary decision diagrams". Electronic Journal of Combinatorics. 3 (1). Research Paper 5. doi:10.37236/1229. MR 1368332. See attached comment by Brendan McKay, Feb 18, 1997, for the corrected count.

archive.org

books.google.com

  • Wegener, I. (2000). Branching Programs and Binary Decision Diagrams. Society for Industrial & Applied Mathematics. ISBN 978-0-89871-458-6.
  • Simon, Dan (2013), Evolutionary Optimization Algorithms, John Wiley & Sons, pp. 449–450, ISBN 9781118659502, The knight's tour problem is a classic combinatorial optimization problem. ... The cardinality Nx of x (the size of the search space) is over 3.3×1013 (Löbbing and Wegener, 1995). We would not want to try to solve this problem using brute force, but by using human insight and ingenuity we can solve the knight's tour without much difficulty. We see that the cardinality of a combinatorial optimization problem is not necessarily indicative of its difficulty.

bridge-india.blogspot.com

combinatorics.org

core.ac.uk

doi.org

  • Brown, Alfred James (2017). Knight's Tours and Zeta Functions (MS thesis). San José State University. p. 3. doi:10.31979/etd.e7ra-46ny.
  • Conrad, A.; Hindrichs, T.; Morsy, H. & Wegener, I. (1994). "Solution of the Knight's Hamiltonian Path Problem on Chessboards". Discrete Applied Mathematics. 50 (2): 125–134. doi:10.1016/0166-218X(92)00170-Q.
  • Allen J. Schwenk (1991). "Which Rectangular Chessboards Have a Knight's Tour?" (PDF). Mathematics Magazine. 64 (5): 325–332. doi:10.1080/0025570X.1991.11977627. S2CID 28726833. Archived from the original (PDF) on 2019-05-26.
  • Löbbing, Martin; Wegener, Ingo (1996). "The number of knight's tours equals 33,439,123,484,294—counting with binary decision diagrams". Electronic Journal of Combinatorics. 3 (1). Research Paper 5. doi:10.37236/1229. MR 1368332. See attached comment by Brendan McKay, Feb 18, 1997, for the corrected count.
  • Parberry, Ian (1997). "An Efficient Algorithm for the Knight's Tour Problem" (PDF). Discrete Applied Mathematics. 73 (3): 251–260. doi:10.1016/S0166-218X(96)00010-8. Archived (PDF) from the original on 2022-10-09.
  • Pohl, Ira (July 1967). "A method for finding Hamilton paths and Knight's tours". Communications of the ACM. 10 (7): 446–449. CiteSeerX 10.1.1.412.8410. doi:10.1145/363427.363463. S2CID 14100648.
  • Alwan, Karla; Waters, K. (1992). Finding Re-entrant Knight's Tours on N-by-M Boards. ACM Southeast Regional Conference. New York, New York: ACM. pp. 377–382. doi:10.1145/503720.503806.

ghostarchive.org

github.com

iiitb.ac.in

math.ca

fq.math.ca

mayhematics.com

psu.edu

citeseerx.ist.psu.edu

semanticscholar.org

api.semanticscholar.org

pdfs.semanticscholar.org

sjsu.edu

scholarworks.sjsu.edu

  • Brown, Alfred James (2017). Knight's Tours and Zeta Functions (MS thesis). San José State University. p. 3. doi:10.31979/etd.e7ra-46ny.

uva.nl

pure.uva.nl

web.archive.org

wolfram.com

mathworld.wolfram.com