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:24, 12 May 2022
, 2 years ago→Some Observations: Go is 49s
(→Simple solution for bishops: Go improvement) |
(→Some Observations: Go is 49s) |
||
Line 238:
So I conclude that this task for knights is feasible without a solver, in fact it beats the solver. The code for the above is ,as yet, far from optimal, so I expect better timings. I stop at 9 because I run out of memory, but solving that is just programming.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 14:27, 8 May 2022 (UTC)
: I have replaced the solver with F# code and timings for knights up to 10. I am a little disappointed with 4minutes and 45seconds for 10 as that doesn't beat the solver(YET!). Otherwise 1/4 second for 8 is good enough.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 10:19, 12 May 2022 (UTC)
:: You've now also up against a Go entry that manages 10 knights in 49s on a ten year old box. 😜 --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 15:23, 12 May 2022 (UTC)
| |||