aspiration search problem: research within original window

Discussion of chess software programming and technical issues.

Moderator: Ras

tpetzke
Posts: 686
Joined: Thu Mar 03, 2011 4:57 pm
Location: Germany

Re: aspiration search problem: research within original wind

Post by tpetzke »

You could reconstruct the full PV (or at least a longer one) from the TT right before printing it. But take care to check legality of each hash move you find when following that path, and of course to unmake these moves again when you're done
and I have to do repetition detection as well. Without that I got sometimes super long PVs that just circled between the same positions.

Thomas...
Sven
Posts: 4052
Joined: Thu May 15, 2008 9:57 pm
Location: Berlin, Germany
Full name: Sven Schüle

Re: aspiration search problem: research within original wind

Post by Sven »

tpetzke wrote:
You could reconstruct the full PV (or at least a longer one) from the TT right before printing it. But take care to check legality of each hash move you find when following that path, and of course to unmake these moves again when you're done
and I have to do repetition detection as well. Without that I got sometimes super long PVs that just circled between the same positions.

Thomas...
Yes. I do that, too, in my engine. Reconstructing the PV stops at first repetition.

Sven