Talk:N-queens minimum and knights and bishops: Difference between revisions
Talk:N-queens minimum and knights and bishops (view source)
Revision as of 18:16, 13 May 2022
, 2 years ago→Simple solution for bishops: more optimisations
(→Simple solution for bishops: Yes, it is worth it.) |
(→Simple solution for bishops: more optimisations) |
||
Line 115:
:First queen on a 10x10 now limited to 9 places (was 28), first knight for n>=3 now limited to 2 places (was 3).
:Time for all solutions to 10x10 dropped from 12 mins to 3 mins (almost all being 10N examining 21,801,024 positions). --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 14:12, 11 May 2022 (UTC)
::Found a cheeky little trick (aka a circumstantial optimisation) which made the tricky 10N only examine 8,163,658 positions, and the total time dropped to 1 min 20s, plus I resurrected cheat mode since that now drops it to 8.3s all in up to 10x0. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 18:16, 13 May 2022 (UTC)
==Some Observations==
| |||