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.
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
Received on Sat Jun 29 2002 - 04:55:59 IDT