At 07:51 29/06/02 -0400, you wrote:
>Hi Shlomi,
>
> I think part of the problem here is the way these positions are being
>designated. I. e., if A is the starting position, we have been talking
>about a sequence of positions A, C, B. It might inject more clarity if we
>put it this way: In the tree network of possible moves from a starting
>position A, two positions with occur along one path are, in sequence, B and
>C. We are speculating on what happens when, along a path proceeding from C,
>position B occurs again. You seem to be saying that the solver, having
>encountered B for a second time, will not eventually return to B once it has
>exhausted all other paths leading onward from B. I submit that if the
>solver does not return to B, something is wrong with its design.
The solver would eventually return to B, but will not recurse from C into
B. I.e: the stack:
A ... B ... C -> B .... [Solution]
would not be formed. Instead the solver would back-track from C, and
eventually form the stack:
A .... B -> D ... [Solution]
At least, this is the way it is implemented in classic DFS.
Regards,
Shlomi Fish
> Hey, Bill Raymond, have you been listening? You started all this. Have
>I gone wrong in my analysis, and if so, where?
>
>Best regards, -----------------Adrian
>
>
>
>
>To unsubscribe from this group, send an email to:
>fc-solve-discuss-unsubscribe_at_yahoogroups.com
>
>
>
>Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
----------------------------------------------------------------------
Shlomi Fish shlomif_at_techie.com
Home Page:
http://t2.technion.ac.il/~shlomif/
I don't believe in fairies. Oops! A fairy died.
I don't believe in fairies. Oops! Another fairy died.
Received on Sat Jun 29 2002 - 06:26:08 IDT