Kahdeksan kuningattaren ongelma (Finnish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Kahdeksan kuningattaren ongelma" in Finnish language version.

refsWebsite

Global rank Finnish rank

3oeis.org

742^nd place

536^th place

2google.fi

5,881^st place

32^nd place

1acm.org

1,185^th place

1,917^th place

1utexas.edu

916^th place

1,127^th place

1helsinki.fi

1,670^th place

16^th place

1claymath.org

8,402^nd place

5,012^th place

1web.archive.org

1^st place

1github.com

383^rd place

1,185^th place

1onb.ac.at

762^nd place

2,167^th place

1theconversation.com

928^th place

920^th place

1mtvuutiset.fi

3,369^th place

8^th place

acm.org

dl.acm.org

Erbas, C. & Sarkeshik, S., & Tanik, M. M.: Different perspectives of the N-queens problem (s. 99–108) Proceedings of the 1992 ACM annual conference on Communications. 1992. Viitattu 2.4.2020.

claymath.org

The 8-Queens Puzzle Clay Mathematics Institute. Arkistoitu 3.7.2020. Viitattu 2.4.2020.

github.com

27-Queens Puzzle: Massively Parellel Enumeration and Solution Counting The Q27 Project. Viitattu 3.4.2020.

google.fi

books.google.fi

Gardner, Martin: Knots and Borromean Rings, Rep-Tiles, and Eight Queens. Cambridge University Press, 2014. ISBN 9780521756136. Google Books -esikatselu (viitattu 2.4.2020).
Neapolitan, Richard E.: Foundations of Algorithms, s. 204–220. Jones & Bartlett Publishers, 2015. ISBN 9781284049206. Google Books -esikatselu (viitattu 2.4.2020).

helsinki.fi

cs.helsinki.fi

Laaksonen, Antti: Kisakoodarin käsikirja (Sivut 48–49) cs.helsinki.fi. 2018. Viitattu 2.4.2020.

mtvuutiset.fi

Kehitä ohjelma "Tuhannen kuningattaren ongelmaan" ja ansaitse 800 000 euroa – ihminen voi ratkaista sen, mutta tekoäly ei MTV Uutiset. 1.9.2017 (päivitetty 2.9.2017). Viitattu 5.4.2020.

oeis.org

A000170 Number of ways of placing n nonattacking queens on an n X n board. The On-Line Encyclopedia of Integer Sequences. The OEIS Foundation. Viitattu 2.4.2020.
A002562 Number of ways of placing n nonattacking queens on n X n board (symmetric solutions count only once). The On-Line Encyclopedia of Integer Sequences. The OEIS Foundation. Viitattu 2.4.2020.
A051906 Number of ways of placing n nonattacking queens on an n X n toroidal chessboard. The On-Line Encyclopedia of Integer Sequences. The OEIS Foundation. Viitattu 2.4.2020.

onb.ac.at

anno.onb.ac.at

”Dr. Nauck”: Schach: Eine in das Gebiet der Mathematik fallende Aufgabe von Herrn Dr. Nauck in Schleusingen. Illustrirte Zeitung, 1.6.1850, 14. vsk, nro 361, s. 352. Artikkelin verkkoversio. Viitattu 15.5.2020.

theconversation.com

Gent, Ian: Why the world’s toughest maths problems are much harder than a chess puzzle, and well worth US$1m theconversation.com. 6.9.2017. Viitattu 5.4.2020.

utexas.edu

cs.utexas.edu

Dijkstra, Edsger W.: A Short Introduction to the Art of Programming. Eindhoven: Technische Hogeschool Eindhoven, 1971. Teoksen verkkoversio (viitattu 2.4.2020).

web.archive.org

The 8-Queens Puzzle Clay Mathematics Institute. Arkistoitu 3.7.2020. Viitattu 2.4.2020.