Talk:N-queens minimum and knights and bishops: Difference between revisions
Talk:N-queens minimum and knights and bishops (view source)
Revision as of 17:45, 12 May 2022
, 2 years ago→Simple solution for bishops: Thanks to Pete!
m (→Some Observations: type) |
(→Simple solution for bishops: Thanks to Pete!) |
||
Line 103:
:: *I've added Go now. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 18:16, 25 April 2022 (UTC)
::: As I'm sure you noticed, I've improved that. Feel free to make the needed tweaks and merge/replace original. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 15:14, 12 May 2022 (UTC)
:::: Hi Pete. Many thanks for doing that which is working great. It's a little faster on my machine (core i7) at 32.6 seconds for 9 bishops and 128 seconds for 10. I'll incorporate the changes into the original Go version and also into the Wren version when I have more time.
::::Do you think it's worth even bothering with bishops when we know from general reasoning that the answer will be 'n' for an 'n x n' board and its trivial to construct an example?
::::Incidentally, I'm working on a GLPK wrapper for Wren as I'd like to have something in the LP/MIP solver area which can at least solve 'small' problems relatively quickly. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 17:45, 12 May 2022 (UTC)
:Applied the suggested optimisations to the Phix entry (many thanks!):
| |||