Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Incremental SEE?

Author: Bas Hamstra

Date: 07:22:04 10/26/00

Go up one level in this thread


On October 26, 2000 at 09:58:53, Sven Reichard wrote:

>I have a question about the implementation. Right now I call SEE before every
>move in the qsearch. Suppose QxB loses 6 points, and I discard the move. Two
>plies down the tree I call SEE again, and QxB still loses 6 points. Does anybody
>have experience of updating the SEE information incrementally?

Well I used to keep attack info incrementally, which gave me the chaepest SEE I
ever saw. That's about the best you can do, I think. But of course it slows down
make/unmake.

Bas.












This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.