Talk:N-queens minimum and knights and bishops: Difference between revisions
Talk:N-queens minimum and knights and bishops (view source)
Revision as of 09:02, 24 April 2022
, 2 years ago→Performance note: Further comment.
(→Performance note: Added some comments.) |
(→Performance note: Further comment.) |
||
Line 22:
:There are, of course, better algorithms for solving the basic N-Queens problem such as 'branch and bound' and 'hill climbing'. If you check out [https://oeis.org/A075458 OEIS A075458], there's a link leading off it to some [https://oeis.org/A075458/a075458.java.txt Java code] written by one of their experts which uses 'hill climbing' to solve the problem for queens. However, whilst it produces quick results, I couldn't see an easy way to just plug in bishops and knights and another thing I didn't like is that the code seems to loop indefinitely so you're never quite sure if you've found an optimal solution or not. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 08:44, 24 April 2022 (UTC)
:Just noticed that A075458 isn't quite the same problem anyway as the queens can still attack one another. If you try a 4 x 4 board in the above code, you get a minimum of 2 queens when the answer we want is 3. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 09:02, 24 April 2022 (UTC)
| |||