Anonymous user
N-queens minimum and knights and bishops: Difference between revisions
N-queens minimum and knights and bishops (view source)
Revision as of 17:57, 29 April 2022
, 2 years agosome links
m (→{{header|Free Pascal}}: new version.All bishops can be in one row takes x5 time up to 10.) |
m (some links) |
||
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.
:[[oeis:A075458|OEIS Domination number for queens]]
:[https://www.sciencedirect.com/science/article/pii/S0166218X09003722 ScienceDirect | minimum dominating set of queens] ways to do it.
=={{header|F_Sharp|F#}}==
|