Talk:N-queens minimum and knights and bishops: Difference between revisions

One thing I have found so far is that <code>integer m=1; while not solveable(m) do m+=1 end while</code> is at least five times faster than finding "any solution" and then exhaustively eliminating the existence of anything better. Since it takes my current approach(/that^) around 15 mins to solve, I'm currently writing a GUI version so you can at least explore (eg) the 8x8 solutions while it is still cranking on with the 10x1010x10s in the background. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 01:03, 24 April 2022 (UTC)