Jump to content

Template:Did you know nominations/Queen's graph

From Wikipedia, the free encyclopedia
The following is an archived discussion of the DYK nomination of the article below. Please do not modify this page. Subsequent comments should be made on the appropriate discussion page (such as this nomination's talk page, the article's talk page or Wikipedia talk:Did you know), unless there is consensus to re-open the discussion at this page. No further edits should be made to this page.

The result was: promoted by Theleekycauldron (talk) 17:35, 3 March 2022 (UTC)

Queen's graph

  • ... that five queens on a chessboard (pictured) can attack or occupy every square on the board? Source: Watkins, John J. (2012). Across the Board: The Mathematics of Chessboard Problems. Princeton University Press. pp. 113–114.

Created by Bilorv (talk). Self-nominated at 22:23, 14 February 2022 (UTC).

abcdefgh
8
f6 white queen
c5 white queen
e4 white queen
g3 white queen
d2 white queen
8
77
66
55
44
33
22
11
abcdefgh
Each square on the board is attacked or occupied by a queen.
General: Article is new enough and long enough
Policy: Article is sourced, neutral, and free of copyright problems
Hook: Hook has been verified by provided inline citation
Image: Image is freely licensed, used in the article, and clear at 100px.
QPQ: Done.

Overall: Nice work. I don't see a problem with using the diagram, although I'm not sure if something other than an image/video file has ever gone into the image slot before. But for now it looks good. Epicgenius (talk) 14:08, 17 February 2022 (UTC)

To T:DYK/P2