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

Added a caveat to OEIS link.
(→‎{{header|Go}}: Further speed up, about 4 times quicker than before.)
(Added a caveat to OEIS link.)
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]] (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.
 
9,485

edits