Talk:N-queens minimum and knights and bishops: Difference between revisions
Talk:N-queens minimum and knights and bishops (view source)
Revision as of 09:37, 24 April 2022
, 2 years ago→Performance note
(→Performance note: Further comment.) |
|||
Line 24:
:Just noticed that A075458 isn't quite the same problem anyway as the queens can still attack one another. If you try a 4 x 4 board in the above code, you get a minimum of 2 queens when the answer we want is 3. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 09:02, 24 April 2022 (UTC)
::Actually that cheat I mentioned isn't needed or particularly helpful, but glad I tried it as it lead to a quite helpful and probably obvious optimisation: if you can't solve a 7x7 board with 6 bishops, no point trying to solve an 8x8 with only 6. There's also "first bishop must be on the main diagonal", and again obviously if there is no answer up to the mid-point, there will not be one after. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 09:36, 24 April 2022 (UTC)
| |||