Re: Trying to solve N-Queens

[demerphq]

I havent looked at this program in a long time. Sigh. Yet another thing to do when I get the chance. Anyway, just a thought for you (you may have dealt with this already I havent reviewd the code in depth yet) but the closest two queens can get to each other is a knight hop away. (Knights move in an L)

In other words the queen in the middle can only have other queens at the locations indicated by '?' (or further away). No queen can possibly be at any of the X locations. Adjust the "circle" of knight hops as is appropriate for the actual amount of the board available given the current queen position.

x	?	x	?	x
?	x	x	x	?
x	x	Q	x	x
?	x	x	x	?
x	?	x	?	x

--- demerphq
my friends call me, usually because I'm late....