[AccessD] 8 Queens Problem Again

[Bill Benson]

Just make sure each of the three queens is on its own color. Done.

On Tue, Feb 8, 2022 at 5:25 PM Arthur Fuller <fuller.artful at gmail.com>
wrote:

> My first solution took 3 minutes 45 seconds/ After examining it for a
> while, I realized that given this first solution, I could come with 2 or 3
> more in a matter of seconds, by moving minimum 2 and occasionally 3 pieces.
> Doubtless any Access program could solve the problem way more quickly. I
> haven't tried to write one yet and think that a solution in C or C++ would
> be faster by an order of magnitude, but let's see what you got. Write it in
> Access. I'm going to try this tonight.
> In case you, dear reader, don't know this problem, here is a concise
> description. Empty the chessboard, then take 8 pawns and pretend they are
> queens. Arrange them such that no queen can capture any other. Corollary:
> any solution can yield at least two more solutions by moving two or three
> pieces at most.
> Send your solution to me privately, including the Access code. Winner gets
> a beer!
>
> --
> Arthur
> --
> AccessD mailing list
> AccessD at databaseadvisors.com
> https://databaseadvisors.com/mailman/listinfo/accessd
> Website: http://www.databaseadvisors.com
>