Anonymous user
Peaceful chess queen armies: Difference between revisions
m
added a ;Task: section header, added whitespace before the TOC.
(Added solution for D) |
m (added a ;Task: section header, added whitespace before the TOC.) |
||
Line 43:
The goal of Peaceful chess queen armies is to arrange <code>m</code> black queens and <code>m</code> white queens on an <code>n-by-n</code> square grid, (the board), so that ''no queen attacks another of a different colour''.
;Task:
# Create a routine to represent two-colour queens on a 2-D board. (Alternating black/white background colours, Unicode chess pieces and other embellishments are not necessary, but may be used at your discretion).
# Create a routine to generate at least one solution to placing <code>m</code> equal numbers of black and white queens on an <code>n</code> square board.
# Display here results for the <code>m=4, n=5</code> case.
;References:
* [http://www.mathopt.org/Optima-Issues/optima62.pdf Peaceably Coexisting Armies of Queens] (Pdf) by Robert A. Bosch. Optima, the Mathematical Programming Socity newsletter, issue 62.
* [https://oeis.org/A250000 A250000] OEIS
<br><br>
=={{header|D}}==
| |||