Knight's tour (English Wikipedia)

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

Last modified: 16:17:13, 9 July 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

138doi.org

2^nd place

43semanticscholar.org

15^th place

8^th place

32ghostarchive.org

64^th place

28^th place

32books.google.com

3^rd place

22archive.org

6^th place

22wolfram.com

1,091^st place

1,169^th place

22web.archive.org

1^st place

22mayhematics.com

low place

21math.ca

low place

21ams.org

434^th place

249^th place

21psu.edu

299^th place

159^th place

11sjsu.edu

7,460^th place

4,844^th place

11iiitb.ac.in

low place

11bridge-india.blogspot.com

low place

11combinatorics.org

low place

11core.ac.uk

1,383^rd place

954^th place

11github.com

380^th place

337^th place

11uva.nl

3,161^st place

2,525^th place

ams.org (Global: 434^th place; English: 249^th place)

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 (Global: 6^th place; English: 6^th place)

Deitel, H. M.; Deitel, P. J. (2003). Java How To Program Fifth Edition (5th ed.). Prentice Hall. pp. 326–328. ISBN 978-0131016217.
Standage, Tom (2002). The Turk: the life and times of the famous eighteenth-century chess-playing machine. Walker & Co. pp. 30–31. ISBN 0-8027-1391-2.

books.google.com (Global: 3^rd place; English: 3^rd place)

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 N_x of x (the size of the search space) is over 3.3×10¹³ (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 (Global: low place; English: low place)

Bridge-india (2011-08-05). "Bridge-India: Paduka Sahasram by Vedanta Desika". Bridge-India. Retrieved 2019-10-16.

combinatorics.org (Global: low place; English: low place)

Brendan McKay (1997). "Knight's Tours on an 8 × 8 Chessboard". Technical Report TR-CS-97-03. Department of Computer Science, Australian National University. Archived from the original on 2013-09-28. Retrieved 2013-09-22.

core.ac.uk (Global: 1,383^rd place; English: 954^th place)

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.

doi.org (Global: 2^nd place; English: 2^nd place)

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.
Cull, P.; De Curtins, J. (1978). "Knight's Tour Revisited" (PDF). Fibonacci Quarterly. 16 (3): 276–285. doi:10.1080/00150517.1978.12430328. Archived (PDF) from the original on 2022-10-09.
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. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
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 (Global: 64^th place; English: 28^th place)

Cull, P.; De Curtins, J. (1978). "Knight's Tour Revisited" (PDF). Fibonacci Quarterly. 16 (3): 276–285. doi:10.1080/00150517.1978.12430328. Archived (PDF) from the original on 2022-10-09.
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.

github.com (Global: 380^th place; English: 337^th place)

Squirrel, Douglas; Cull, P. (1996). "A Warnsdorff-Rule Algorithm for Knight's Tours on Square Boards" (PDF). GitHub. Retrieved 2011-08-21.

iiitb.ac.in (Global: low place; English: low place)

"Indian Institute of Information Technology, Bangalore". www.iiitb.ac.in. Retrieved 2019-10-11.

math.ca (Global: low place; English: low place)

fq.math.ca

Cull, P.; De Curtins, J. (1978). "Knight's Tour Revisited" (PDF). Fibonacci Quarterly. 16 (3): 276–285. doi:10.1080/00150517.1978.12430328. Archived (PDF) from the original on 2022-10-09.

mayhematics.com (Global: low place; English: low place)

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

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. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

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.
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. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)

pdfs.semanticscholar.org

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.

sjsu.edu (Global: 7,460^th place; English: 4,844^th place)

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 (Global: 3,161^st place; English: 2,525^th place)

pure.uva.nl

Van Horn, Gijs; Olij, Richard; Sleegers, Joeri; Van den Berg, Daan (2018). A Predictive Data Analytic for the Hardness of Hamiltonian Cycle Problem Instances (PDF). DATA ANALYTICS 2018: The Seventh International Conference on Data Analytics. Athens, greece: XPS. pp. 91–96. ISBN 978-1-61208-681-1. Retrieved 2018-11-27.

web.archive.org (Global: 1^st place; English: 1^st place)

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.
Brendan McKay (1997). "Knight's Tours on an 8 × 8 Chessboard". Technical Report TR-CS-97-03. Department of Computer Science, Australian National University. Archived from the original on 2013-09-28. Retrieved 2013-09-22.

Knight's tour (English Wikipedia)

ams.org (Global: 434^th place; English: 249^th place)

mathscinet.ams.org

archive.org (Global: 6^th place; English: 6^th place)

books.google.com (Global: 3^rd place; English: 3^rd place)

bridge-india.blogspot.com (Global: low place; English: low place)

combinatorics.org (Global: low place; English: low place)

core.ac.uk (Global: 1,383^rd place; English: 954^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

ghostarchive.org (Global: 64^th place; English: 28^th place)

github.com (Global: 380^th place; English: 337^th place)

iiitb.ac.in (Global: low place; English: low place)

math.ca (Global: low place; English: low place)

fq.math.ca

mayhematics.com (Global: low place; English: low place)

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

pdfs.semanticscholar.org

sjsu.edu (Global: 7,460^th place; English: 4,844^th place)

scholarworks.sjsu.edu

uva.nl (Global: 3,161^st place; English: 2,525^th place)

pure.uva.nl

web.archive.org (Global: 1^st place; English: 1^st place)

wolfram.com (Global: 1,091^st place; English: 1,169^th place)

mathworld.wolfram.com

Knight's tour (English Wikipedia)

ams.org (Global: 434th place; English: 249th place)

mathscinet.ams.org

archive.org (Global: 6th place; English: 6th place)

books.google.com (Global: 3rd place; English: 3rd place)

bridge-india.blogspot.com (Global: low place; English: low place)

combinatorics.org (Global: low place; English: low place)

core.ac.uk (Global: 1,383rd place; English: 954th place)

doi.org (Global: 2nd place; English: 2nd place)

ghostarchive.org (Global: 64th place; English: 28th place)

github.com (Global: 380th place; English: 337th place)

iiitb.ac.in (Global: low place; English: low place)

math.ca (Global: low place; English: low place)

fq.math.ca

mayhematics.com (Global: low place; English: low place)

psu.edu (Global: 299th place; English: 159th place)

citeseerx.ist.psu.edu

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

pdfs.semanticscholar.org

sjsu.edu (Global: 7,460th place; English: 4,844th place)

scholarworks.sjsu.edu

uva.nl (Global: 3,161st place; English: 2,525th place)

pure.uva.nl

web.archive.org (Global: 1st place; English: 1st place)

wolfram.com (Global: 1,091st place; English: 1,169th place)

mathworld.wolfram.com

ams.org (Global: 434^th place; English: 249^th place)

archive.org (Global: 6^th place; English: 6^th place)

books.google.com (Global: 3^rd place; English: 3^rd place)

core.ac.uk (Global: 1,383^rd place; English: 954^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

ghostarchive.org (Global: 64^th place; English: 28^th place)

github.com (Global: 380^th place; English: 337^th place)

psu.edu (Global: 299^th place; English: 159^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

sjsu.edu (Global: 7,460^th place; English: 4,844^th place)

uva.nl (Global: 3,161^st place; English: 2,525^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

wolfram.com (Global: 1,091^st place; English: 1,169^th place)