Author: Christophe Theron
Date: 16:28:20 06/30/98
Go up one level in this thread
On June 30, 1998 at 07:32:40, Ulrich Tuerke wrote:
>My conclusion is that these ideas are worth a try in cases where for some reason
>only limited hash tables are available, but in general these attempts are
>obsolete. But this is only a personal prejudice, didn't really run huge test
>cases, only a few positions (for both of the above cases).
I get 1% less nodes to search when I use refutation tables, but my program gets
1% slower (tested on 40 early and middlegame positions). So the advantage is not
obvious.
I keep them for the moment, as I suspect they can help a lot on a small number
of problematic positions, but I don't like to add complexity without a strong
compensation.
Christophe
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.