Revision history of "2016 OIM Problems/Problem 4"

Diff selection: Mark the radio boxes of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

  • (cur | prev) 13:58, 14 December 2023Tomasdiaz (talk | contribs). . (540 bytes) (+540). . (Created page with "== Problem == Find the greatest number of bishops that can be placed on an <math>8 \times 8</math> chess board, so that no two bishops are on the same square and each bishop i...")