This is a program to solve the above chess queen puzzle. It is flexible enough to work with a board of variable size, with a variable number of queens.
Given a board of size X by X with N queens, what is the configuration that produces the GREATEST number of squares without any threats?
This is a program to solve the above chess queen puzzle. It is flexible enough to work with a board of variable size, with a variable number of queens.
Given a board of size X by X with N queens, what is the configuration that produces the GREATEST number of squares without any threats?
The Unlicense