Talk:N-queens minimum and knights and bishops: Difference between revisions
Content added Content deleted
m (Easy example for bishops) |
(→Simple solution for bishops: Replied to Horsth.) |
||
Line 59: | Line 59: | ||
. . . b . . </pre> |
. . . b . . </pre> |
||
--[[User:Horsth|Horsth]] ([[User talk:Horsth|talk]]) 16:47, 25 April 2022 (UTC) |
--[[User:Horsth|Horsth]] ([[User talk:Horsth|talk]]) 16:47, 25 April 2022 (UTC) |
||
: Although I realized this some time ago and several sources simply state the minimum number of bishops to be N for an N x N board I haven't been able to find a mathematical proof of this. In other words how do you know that there isn't a solution which only uses N-1 bishops? |
|||
: Incidentally, although I've written a Go solution, the only one I've posted so far is Wren. The former is, of course, much quicker but still far too slow for my liking. |
|||
: Any ideas on how the performance of the Wren solution could be improved? I've tried a number of things but (apart from improving the diagonal checking) no joy so far. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 17:11, 25 April 2022 (UTC) |