N-queens minimum and knights and bishops: Difference between revisions
Content added Content deleted
m (→{{header|Free Pascal}}: new version.All bishops can be in one row takes x5 time up to 10.) |
m (some links) |
||
| 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]] |
|||
:[https://www.sciencedirect.com/science/article/pii/S0166218X09003722 ScienceDirect | minimum dominating set of queens] ways to do it. |
|||
=={{header|F_Sharp|F#}}== |
=={{header|F_Sharp|F#}}== |
||