Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Non Tablebase Tournaments

Author: Dieter Buerssner

Date: 10:46:43 04/15/05

Go up one level in this thread


On April 14, 2005 at 22:51:49, Dann Corbit wrote:

[Expriments show that TBs don't help]

>It appears that the cost of a lookup is about the same as the cost of
>calculation.

This could be the cause, or at least one reason. I guess, that the main reason
is more complicated. Robert Allgeuer reported, that he actually did not see
cases of (bigger) slowdowns. I think, that another reason is, that the search
tree changed in a way, that makes search less efficient (in some cases). But I
have not really understood it yet. For example, I have seen cases, where with
TBs the score hangs at 0.0 for a while, and without TBs it showed (say) a score
of 0.1 that is increasing. The non TB search was on the right direction. All
those 0.0 scores (from TBs) might hurt move ordering at later stages. It is
clear, that probing only at the root must help, at least against an opponent
with TBs. When the opponent has no TBs with little effort, it must help, too.
For example with a Crafty like "cheat mode" (?), where only moves with the game
theoretical score are tried.

Regards,
Dieter


Regards,
Dieter



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.