Eight queens puzzle (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Eight queens puzzle" in English language version.

refsWebsite

Global rank English rank

12doi.org

2^nd place

3semanticscholar.org

11^th place

8^th place

3arxiv.org

69^th place

59^th place

3handle.net

102^nd place

76^th place

3worldcat.org

5^th place

2web.archive.org

1^st place

2ams.org

451^st place

277^th place

2nih.gov

4^th place

1jstor.org

26^th place

20^th place

1github.com

383^rd place

320^th place

1quantamagazine.org

6,413^th place

4,268^th place

1lyndenlea.info

low place

1vector.org.uk

low place

1jair.org

low place

1psu.edu

207^th place

136^th place

1ieee.org

652^nd place

515^th place

1cam.ac.uk

670^th place

480^th place

1harvard.edu

18^th place

17^th place

1informatika-21.ru

low place

1thealmightyguru.com

low place

1g-takumi.com

low place

ams.org

mathscinet.ams.org

Burger, A. P.; Cockayne, E. J.; Mynhardt, C. M. (1997), "Domination and irredundance in the queens' graph", Discrete Mathematics, 163 (1–3): 47–66, doi:10.1016/0012-365X(95)00327-S, hdl:1828/2670, MR 1428557
Weakley, William D. (2018), "Queens around the world in twenty-five years", in Gera, Ralucca; Haynes, Teresa W.; Hedetniemi, Stephen T. (eds.), Graph Theory: Favorite Conjectures and Open Problems – 2, Problem Books in Mathematics, Cham: Springer, pp. 43–54, doi:10.1007/978-3-319-97686-0_5, ISBN 978-3-319-97684-6, MR 3889146

arxiv.org

Simkin, Michael (28 July 2021). "The number of $n$-queens configurations". arXiv:2107.13460v2 [math.CO].
Luria, Zur (15 May 2017). "New bounds on the number of n-queens configurations". arXiv:1705.05225v2 [math.CO].
Bowtell, Candida; Keevash, Peter (16 September 2021). "The $n$-queens problem". arXiv:2109.08083v1 [math.CO].

cam.ac.uk

cl.cam.ac.uk

Richards, Martin (1997). Backtracking Algorithms in MCPL using Bit Patterns and Recursion (PDF) (Technical report). University of Cambridge Computer Laboratory. UCAM-CL-TR-433.

doi.org

Bo Bernhardsson (1991). "Explicit Solutions to the N-Queens Problem for All N". ACM SIGART Bulletin. 2 (2): 7. doi:10.1145/122319.122322. S2CID 10644706.
Hoffman, E. J.; Loessi, J. C.; Moore, R. C. (1 March 1969). "Constructions for the Solution of the m Queens Problem". Mathematics Magazine. 42 (2): 66. doi:10.2307/2689192. JSTOR 2689192. Archived 8 November 2016 at the Wayback Machine
Chatham, Doug (1 December 2018). "Reflections on the n +k dragon kings problem". Recreational Mathematics Magazine. 5 (10): 39–55. doi:10.2478/rmm-2018-0007.
Burger, A. P.; Cockayne, E. J.; Mynhardt, C. M. (1997), "Domination and irredundance in the queens' graph", Discrete Mathematics, 163 (1–3): 47–66, doi:10.1016/0012-365X(95)00327-S, hdl:1828/2670, MR 1428557
Weakley, William D. (2018), "Queens around the world in twenty-five years", in Gera, Ralucca; Haynes, Teresa W.; Hedetniemi, Stephen T. (eds.), Graph Theory: Favorite Conjectures and Open Problems – 2, Problem Books in Mathematics, Cham: Springer, pp. 43–54, doi:10.1007/978-3-319-97686-0_5, ISBN 978-3-319-97684-6, MR 3889146
Bell, Jordan; Stevens, Brett (2009). "A survey of known results and research areas for n-queens". Discrete Mathematics. 309 (1): 1–31. doi:10.1016/j.disc.2007.12.043.
Gent, Ian P.; Jefferson, Christopher; Nightingale, Peter (August 2017). "Complexity of n-Queens Completion". Journal of Artificial Intelligence Research. 59: 815–848. doi:10.1613/jair.5512. hdl:10023/11627. ISSN 1076-9757. Retrieved 7 September 2017.
Glock, Stefan; Correia, David Munhá; Sudakov, Benny (6 July 2022). "The n-queens completion problem". Research in the Mathematical Sciences. 9 (41): 41. doi:10.1007/s40687-022-00335-1. PMC 9259550. PMID 35815227. S2CID 244478527.
Minton, Steven; Johnston, Mark D.; Philips, Andrew B.; Laird, Philip (1 December 1992). "Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems". Artificial Intelligence. 58 (1): 161–205. doi:10.1016/0004-3702(92)90007-K. hdl:2060/19930006097. ISSN 0004-3702. S2CID 14830518.
Sosic, R.; Gu, Jun (October 1994). "Efficient local search with conflict minimization: a case study of the n-queens problem". IEEE Transactions on Knowledge and Data Engineering. 6 (5): 661–668. doi:10.1109/69.317698. ISSN 1558-2191.
Qiu, Zongyan (February 2002). "Bit-vector encoding of n-queen problem". ACM SIGPLAN Notices. 37 (2): 68–70. doi:10.1145/568600.568613.

dx.doi.org

Minton, Steven; Johnston, Mark D.; Philips, Andrew B.; Laird, Philip (1 December 1992). "Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems". Artificial Intelligence. 58 (1): 161–205. doi:10.1016/0004-3702(92)90007-K. hdl:2060/19930006097. ISSN 0004-3702. S2CID 14830518.

g-takumi.com

layton-fushigi.g-takumi.com

"ナゾ130 クイーンの問題5". ゲームの匠 (in Japanese). Retrieved 17 September 2021.

github.com

"The Q27 Project" – via GitHub.

handle.net

hdl.handle.net

Burger, A. P.; Cockayne, E. J.; Mynhardt, C. M. (1997), "Domination and irredundance in the queens' graph", Discrete Mathematics, 163 (1–3): 47–66, doi:10.1016/0012-365X(95)00327-S, hdl:1828/2670, MR 1428557
Gent, Ian P.; Jefferson, Christopher; Nightingale, Peter (August 2017). "Complexity of n-Queens Completion". Journal of Artificial Intelligence Research. 59: 815–848. doi:10.1613/jair.5512. hdl:10023/11627. ISSN 1076-9757. Retrieved 7 September 2017.
Minton, Steven; Johnston, Mark D.; Philips, Andrew B.; Laird, Philip (1 December 1992). "Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems". Artificial Intelligence. 58 (1): 161–205. doi:10.1016/0004-3702(92)90007-K. hdl:2060/19930006097. ISSN 0004-3702. S2CID 14830518.

harvard.edu

ui.adsabs.harvard.edu

Wirth, Niklaus (1976). Algorithms + Data Structures = Programs. Prentice-Hall Series in Automatic Computation. Prentice-Hall. Bibcode:1976adsp.book.....W. ISBN 978-0-13-022418-7. p. 145

ieee.org

ieeexplore.ieee.org

Sosic, R.; Gu, Jun (October 1994). "Efficient local search with conflict minimization: a case study of the n-queens problem". IEEE Transactions on Knowledge and Data Engineering. 6 (5): 661–668. doi:10.1109/69.317698. ISSN 1558-2191.

informatika-21.ru

Wirth, Niklaus (2012) [orig. 2004]. "The Eight Queens Problem". Algorithms and Data Structures (PDF). Oberon version with corrections and authorized modifications. pp. 114–118.

jair.org

Gent, Ian P.; Jefferson, Christopher; Nightingale, Peter (August 2017). "Complexity of n-Queens Completion". Journal of Artificial Intelligence Research. 59: 815–848. doi:10.1613/jair.5512. hdl:10023/11627. ISSN 1076-9757. Retrieved 7 September 2017.

jstor.org

Hoffman, E. J.; Loessi, J. C.; Moore, R. C. (1 March 1969). "Constructions for the Solution of the m Queens Problem". Mathematics Magazine. 42 (2): 66. doi:10.2307/2689192. JSTOR 2689192. Archived 8 November 2016 at the Wayback Machine

lyndenlea.info

queens.lyndenlea.info

Martin S. Pearson. "Queens On A Chessboard – Beyond The 2nd Dimension" (php). Retrieved 27 January 2020.

nih.gov

ncbi.nlm.nih.gov

Glock, Stefan; Correia, David Munhá; Sudakov, Benny (6 July 2022). "The n-queens completion problem". Research in the Mathematical Sciences. 9 (41): 41. doi:10.1007/s40687-022-00335-1. PMC 9259550. PMID 35815227. S2CID 244478527.

pubmed.ncbi.nlm.nih.gov

Glock, Stefan; Correia, David Munhá; Sudakov, Benny (6 July 2022). "The n-queens completion problem". Research in the Mathematical Sciences. 9 (41): 41. doi:10.1007/s40687-022-00335-1. PMC 9259550. PMID 35815227. S2CID 244478527.

psu.edu

citeseerx.ist.psu.edu

A Polynomial Time Algorithm for the N-Queen Problem by Rok Sosic and Jun Gu, 1990. Describes run time for up to 500,000 Queens which was the max they could run due to memory constraints.

quantamagazine.org

Sloman, Leila (21 September 2021). "Mathematician Answers Chess Problem About Attacking Queens". Quanta Magazine. Retrieved 22 September 2021.

semanticscholar.org

api.semanticscholar.org

Bo Bernhardsson (1991). "Explicit Solutions to the N-Queens Problem for All N". ACM SIGART Bulletin. 2 (2): 7. doi:10.1145/122319.122322. S2CID 10644706.
Glock, Stefan; Correia, David Munhá; Sudakov, Benny (6 July 2022). "The n-queens completion problem". Research in the Mathematical Sciences. 9 (41): 41. doi:10.1007/s40687-022-00335-1. PMC 9259550. PMID 35815227. S2CID 244478527.
Minton, Steven; Johnston, Mark D.; Philips, Andrew B.; Laird, Philip (1 December 1992). "Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems". Artificial Intelligence. 58 (1): 161–205. doi:10.1016/0004-3702(92)90007-K. hdl:2060/19930006097. ISSN 0004-3702. S2CID 14830518.

thealmightyguru.com

DeMaria, Rusel (15 November 1993). The 7th Guest: The Official Strategy Guide (PDF). Prima Games. ISBN 978-1-5595-8468-5. Retrieved 22 April 2021.

vector.org.uk

"Queens and knights problem". Archived from the original on 16 October 2005. Retrieved 20 September 2005.

web.archive.org

Hoffman, E. J.; Loessi, J. C.; Moore, R. C. (1 March 1969). "Constructions for the Solution of the m Queens Problem". Mathematics Magazine. 42 (2): 66. doi:10.2307/2689192. JSTOR 2689192. Archived 8 November 2016 at the Wayback Machine
"Queens and knights problem". Archived from the original on 16 October 2005. Retrieved 20 September 2005.

worldcat.org

search.worldcat.org

Gent, Ian P.; Jefferson, Christopher; Nightingale, Peter (August 2017). "Complexity of n-Queens Completion". Journal of Artificial Intelligence Research. 59: 815–848. doi:10.1613/jair.5512. hdl:10023/11627. ISSN 1076-9757. Retrieved 7 September 2017.
Minton, Steven; Johnston, Mark D.; Philips, Andrew B.; Laird, Philip (1 December 1992). "Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems". Artificial Intelligence. 58 (1): 161–205. doi:10.1016/0004-3702(92)90007-K. hdl:2060/19930006097. ISSN 0004-3702. S2CID 14830518.
Sosic, R.; Gu, Jun (October 1994). "Efficient local search with conflict minimization: a case study of the n-queens problem". IEEE Transactions on Knowledge and Data Engineering. 6 (5): 661–668. doi:10.1109/69.317698. ISSN 1558-2191.