Computer Chess Club Archives


Search

Terms

Messages

Subject: QSearch and SEE

Author: Bas Hamstra

Date: 09:41:07 08/08/99


Bob,

I read that thread with interest. I am experimenting with the qsearch (and SEE)
too. Currently I use only check evasions in the qsearch. I don't like it when
the qsearch stumbles per accident on a mate and it doesn't see it's a mate. And
it returning a bogus Eval because Eval was > Beta. With evasions only that won't
happen. It doesn't cost an awful lot of nodes and it sees mates quicker.

And I can confirm that SEE ordering doesn't give a great reduction in treesize
but throwing out losers is a win. However I did a MVV/LVA scheme while only
throwing out "obvious" losers. That is, when A > D and after the capture A is
hanging, throw it out. That's much faster than SEE. If I'm not mistaken it did
not do much worse than SEE.

(tried to reply to some posts yesterday, but couldn't post)

Regards,
Bas Hamstra.






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.