سفر اسب (Persian Wikipedia)

Analysis of information sources in references of the Wikipedia article "سفر اسب" in Persian language version.

refsWebsite

Global rank Persian rank

2^nd place

2^nd place

6^th place

9^th place

2combinatorics.org

low place

low place

2web.archive.org

1^st place

1^st place

1,185^th place

1,084^th place

1books.google.com

3^rd place

6^th place

513^th place

646^th place

low place

low place

1josiahland.com

low place

low place

1,336^th place

9,780^th place

383^rd place

1,455^th place

acm.org

portal.acm.org

Pohl, Ira (July 1967). "A method for finding Hamilton paths and Knight's tours". Communications of the ACM. 10 (7): 446–449. doi:10.1145/363427.363463.
Alwan, Karla (1992). Finding Re-entrant Knight's Tours on N-by-M Boards (PDF). ACM Southeast Regional Conference. New York, New York: ACM. pp. 377–382. doi:10.1145/503720.503806. Retrieved 2008-10-28. {{cite conference}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)

archive.org

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.
Cull, P. (June 1978). "Knight's Tour Revisited". Fibonacci Quarterly. 16: 276–285. {{cite journal}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)

books.google.com

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

combinatorics.org

Martin Loebbing; Ingo Wegener (1996). "The Number of Knight's Tours Equals 33,439,123,484,294 — Counting with Binary Decision Diagrams". The Electronic Journal of Combinatorics. 3 (1): R5.{{cite journal}}: نگهداری یادکرد:نام‌های متعدد:فهرست نویسندگان (link) Remark: The authors later admitted that the announced number is incorrect. According to McKay's report, the correct number is 13,267,364,410,532 and this number is repeated in Wegener's 2000 book.
Brendan McKay (1997). "Knight's Tours on an 8x8 Chessboard". Technical Report TR-CS-97-03. Department of Computer Science, Australian National University. Archived from the original on 27 January 2012. Retrieved 24 June 2013.

doi.org

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.
Parberry, Ian (1997). "An Efficient Algorithm for the Knight's Tour Problem" (PDF). Discrete Applied Mathematics. 73: 251–260. doi:10.1016/S0166-218X(96)00010-8. Archived from the original (PDF) on 27 September 2013. Retrieved 24 June 2013.
Pohl, Ira (July 1967). "A method for finding Hamilton paths and Knight's tours". Communications of the ACM. 10 (7): 446–449. doi:10.1145/363427.363463.
Alwan, Karla (1992). Finding Re-entrant Knight's Tours on N-by-M Boards (PDF). ACM Southeast Regional Conference. New York, New York: ACM. pp. 377–382. doi:10.1145/503720.503806. Retrieved 2008-10-28. {{cite conference}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)

github.com

Squirrel, Douglas (1996). "A Warnsdorff-Rule Algorithm for Knight's Tours on Square Boards" (PDF). Retrieved 2011-08-21. {{cite web}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)

josiahland.com

"Enumerating the Knight's Tour".

math.ca

fq.math.ca

Cull, Paul. "Knight's Tour Revisited" (PDF). Fibonacci Quarterly. Retrieved 5 August 2012.

unt.edu

larc.unt.edu

Parberry, Ian (1997). "An Efficient Algorithm for the Knight's Tour Problem" (PDF). Discrete Applied Mathematics. 73: 251–260. doi:10.1016/S0166-218X(96)00010-8. Archived from the original (PDF) on 27 September 2013. Retrieved 24 June 2013.

web.archive.org

Brendan McKay (1997). "Knight's Tours on an 8x8 Chessboard". Technical Report TR-CS-97-03. Department of Computer Science, Australian National University. Archived from the original on 27 January 2012. Retrieved 24 June 2013.
Parberry, Ian (1997). "An Efficient Algorithm for the Knight's Tour Problem" (PDF). Discrete Applied Mathematics. 73: 251–260. doi:10.1016/S0166-218X(96)00010-8. Archived from the original (PDF) on 27 September 2013. Retrieved 24 June 2013.

wolfram.com

mathworld.wolfram.com

Weisstein, Eric W. "Knight's Tour". MathWorld.