Hi Shlomi,
This all started with an assertion by Bill Raymond that a given position
might be judged solvable or unsolvable depending on whether it is treated as
an initial position as opposed to having been derived in the course of a
solver's solving process. What you've been saying seems to me to imply that
you are disagreeing with that assertion.
Here's another way to state the logic of it. If there is a sequence of
positions along a path A-B-C, and B occurs again in further processing
beyond C, B will not even be examined for solvability, because it will not
be stored in the stack.
Best regards, ----------------Adrian
Received on Sat Jun 29 2002 - 21:15:39 IDT