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

N-queens minimum and knights and bishops (view source)

81 bytes added , 2 years ago

Replaced existing OEIS link for queens with an 'independent domination' one and also added a similar link for knights.

9,485

edits

Revision as of 11:19, 13 May 2022 (view source) PureFox (talk \| contribs) m (→‎{{header\|Wren}}: Typo.) ← Older edit		Revision as of 13:45, 13 May 2022 (view source) PureFox (talk \| contribs) (Replaced existing OEIS link for queens with an 'independent domination' one and also added a similar link for knights.) Newer edit →
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.▼ ;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#}}== <lang fsharp>