Talk:N-queens minimum and knights and bishops: Difference between revisions
Talk:N-queens minimum and knights and bishops (view source)
Revision as of 15:38, 11 May 2022
, 2 years ago→Simple solution for bishops: added suggestion for Wren (ping PureFox)
m (→Performance note: <del>'d my cheat remark) |
(→Simple solution for bishops: added suggestion for Wren (ping PureFox)) |
||
Line 98:
: 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)
::My suggestion would be to save i,j at <code>allAttacked = false</code>, then also test <code>and that square or attacks it</code>. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 15:37, 11 May 2022 (UTC)
:: *I've added Go now. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 18:16, 25 April 2022 (UTC)
==Some Observations==
|