[AccessD] 8 Queens Problem Again

[Stuart McLachlan]

Solutions in dozens of languages for any numbr of queens:  :-)

https://rosettacode.org/wiki/N-queens_problem

On 8 Feb 2022 at 17:25, Arthur Fuller 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
> --