Re: position 8 queens on a board without attack

From: bart demoen (bmd_at_cs.kuleuven.ac.be)
Date: 04/09/04 

Date: Fri, 09 Apr 2004 20:40:27 +0200

Gregor Rot wrote:
>
> Thank you very much for your time and explanation,

Pas de quoi - you ask a decent question, the net provides you with a
decent answer (or at least tries to)

Two more things ...

You wrote:

"how many different combinations for the placement of the queens Prolog
tryed out before returning the first solution"

1) this sentence mentions Prolog - I would say that your question
asks about a property of your algorithm, not about a property of Prolog

2) there is another quantity you might be interested in: how many
"atomic" constraint checks does your algorithm perform before the first
solution is fixed

A check like Y=\=Y1 is atomic, while noattack(X/Y,Others) is not.

Just put your iteration goals at appropriate places and you will know.

Cheers

Bart Demoen