Anonymous user
Talk:N-queens minimum and knights and bishops: Difference between revisions
Talk:N-queens minimum and knights and bishops (view source)
Revision as of 16:47, 25 April 2022
, 2 years agoEasy example for bishops
m (re-signed) |
m (Easy example for bishops) |
||
Line 29:
::Actually that cheat I mentioned isn't needed or particularly helpful (when paired off with a prove chaser that is), 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)
== Simple solution for bishops ==
Just place them in one row or column next to the middle.<br>For example 10 by 10.<br>
<pre>0000210000
0000120000
0001002000
0010000200
0100000020
bbbbbbbbbb
0000000000
0000000000
0000000000
0000000000</pre>
One can see that the GO -solution
<pre>
b . . B . .
. . . B . .
. . . B . .
. . . . . .
. . b B . .
. . . . . . </pre>
can be easily transformed, by moving b's along their diagonals.
<pre>
. . . B . .
. . . B . .
. . . B . .
. . . b . .
. . . B . .
. . . b . . </pre>
--[[User:Horsth|Horsth]] ([[User talk:Horsth|talk]]) 16:47, 25 April 2022 (UTC)
| |||