Problema de la ruta del cavall (Catalan Wikipedia)

Analysis of information sources in references of the Wikipedia article "Problema de la ruta del cavall" in Catalan language version.

refsWebsite

Global rank Catalan rank

2^nd place

6^th place

2combinatorics.org

low place

low place

2web.archive.org

1^st place

1^st place

1,185^th place

1,003^rd place

1,849^th place

2^nd place

513^th place

202^nd place

low place

low place

1josiahland.com

low place

low place

1,336^th place

3,652^nd place

383^rd place

933^rd place

acm.org

portal.acm.org

Pohl, Ira «A method for finding Hamilton paths and Knight's tours». Communications of the ACM, 10, 7, juliol 1967, pàg. 446–449. DOI: 10.1145/363427.363463.
Alwan, Karla; Waters, K. (1992). "Finding Re-entrant Knight's Tours on N-by-M Boards" (PDF) a ACM Southeast Regional Conference. : 377–382, New York, New York: ACM. DOI:10.1145/503720.503806 [Consulta: 2008]

combinatorics.org

Martin Loebbing; Ingo Wegener «The Number of Knight's Tours Equals 33,439,123,484,294 — Counting with Binary Decision Diagrams». The Electronic Journal of Combinatorics, 3, 1, 1996, pàg. R5. Important: Els autors posteriorment varen admetre que el nombre anunciat és incorrecte. D'acord amb el treball de McKay's el nombre correcte és 13,267,364,410,532 i aquest nombre és reflectit al llibre de Wegener de 2000.
Brendan McKay «Knight's Tours on an 8x8 Chessboard». Technical Report TR-CS-97-03. Department of Computer Science, Australian National University, 1997. Arxivat de l'original el 2012-01-27 [Consulta: 6 abril 2013].

doi.org

dx.doi.org

Conrad, A.; Hindrichs, T.; Morsy, H.; Wegener, I. «Solution of the Knight's Hamiltonian Path Problem on Chessboards». Discrete Applied Mathematics, 50, 2, 1994, pàg. 125–134. DOI: 10.1016/0166-218X(92)00170-Q.
Parberry, Ian «An Efficient Algorithm for the Knight's Tour Problem». Discrete Applied Mathematics, 73, 1997, pàg. 251–260. Arxivat de l'original el 2013-09-27. DOI: 10.1016/S0166-218X(96)00010-8 [Consulta: 9 abril 2013].
Pohl, Ira «A method for finding Hamilton paths and Knight's tours». Communications of the ACM, 10, 7, juliol 1967, pàg. 446–449. DOI: 10.1145/363427.363463.
Alwan, Karla; Waters, K. (1992). "Finding Re-entrant Knight's Tours on N-by-M Boards" (PDF) a ACM Southeast Regional Conference. : 377–382, New York, New York: ACM. DOI:10.1145/503720.503806 [Consulta: 2008]

github.com

Squirrel, Douglas; Cull, P. «A Warnsdorff-Rule Algorithm for Knight's Tours on Square Boards», 1996. [Consulta: 21 agost 2011].

google.cat

books.google.cat

Wegener, I.. Branching Programs and Binary Decision Diagrams. Society for Industrial & Applied Mathematics, 2000. ISBN 0-89871-458-3.

josiahland.com

«Enumerating the Knight's Tour».

math.ca

fq.math.ca

Cull, Paul. «Knight's Tour Revisited». Fibonacci Quarterly. [Consulta: 5 agost 2012].

unt.edu

larc.unt.edu

Parberry, Ian «An Efficient Algorithm for the Knight's Tour Problem». Discrete Applied Mathematics, 73, 1997, pàg. 251–260. Arxivat de l'original el 2013-09-27. DOI: 10.1016/S0166-218X(96)00010-8 [Consulta: 9 abril 2013].

web.archive.org

Brendan McKay «Knight's Tours on an 8x8 Chessboard». Technical Report TR-CS-97-03. Department of Computer Science, Australian National University, 1997. Arxivat de l'original el 2012-01-27 [Consulta: 6 abril 2013].
Parberry, Ian «An Efficient Algorithm for the Knight's Tour Problem». Discrete Applied Mathematics, 73, 1997, pàg. 251–260. Arxivat de l'original el 2013-09-27. DOI: 10.1016/S0166-218X(96)00010-8 [Consulta: 9 abril 2013].

wolfram.com

mathworld.wolfram.com

Weisstein, Eric W., «Knight's Tour» a MathWorld (en anglès).