Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: With tablebases play programs stronger!

Author: Richard Pijl

Date: 06:57:45 04/25/02

Go up one level in this thread



>It slows down the search only if the implementation has bugs.
>
>Without bugs it should do the search faster because probing the tablebases can
>be done only in cases that not probing them means wasting more time.
>
Not true. At the expense of one tablebase probe you can search many nodes.
Especially when getting close to leaf nodes (or in them) a tablebase probe is
more expensive. Having perfect knowledge is not always useful as most evaluation
functions will correctly evaluate the position to be outside the ab windows.
This will be the most common situation as it deals with unfavourable piece
exchanges and giving away material.

Richard.



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.