N-queens minimum and knights and bishops: Difference between revisions

Content added Content deleted
(Replaced existing OEIS link for queens with an 'independent domination' one and also added a similar link for knights.)
Line 4: Line 4:


For N=1 to 10 discover the minimum number of Queens, Bishops, and Knights required to fulfill the above requirement. For N=8 print out a possible solution for Queens and Bishops.
For N=1 to 10 discover the minimum number of Queens, Bishops, and Knights required to fulfill the above requirement. For N=8 print out a possible solution for Queens and Bishops.
:[[oeis:A075458|OEIS Domination number for queens]] (note though that queens can still attack each other)
:[https://www.sciencedirect.com/science/article/pii/S0166218X09003722 ScienceDirect | minimum dominating set of queens] ways to do it.


;Links:
* [[oeis:https://oeis.org/A075324|OEIS Independent domination number for queens]]
* [[oeis:https://oeis.org/A342576|OEIS Independent domination number for knights]]
* [https://www.sciencedirect.com/science/article/pii/S0166218X09003722 ScienceDirect | minimum dominating set of queens] - ways to do it.
<br><br>
=={{header|F_Sharp|F#}}==
=={{header|F_Sharp|F#}}==
<lang fsharp>
<lang fsharp>