Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Nalimov Tablebases

Author: José de Jesús García Ruvalcaba

Date: 13:30:23 04/09/99

Go up one level in this thread


On April 09, 1999 at 16:12:38, Eugene Nalimov wrote:

>On April 09, 1999 at 14:38:48, James T. Walker wrote:
>
>>Does anyone know when generating the tablebases if there is a direct relation
>>between the number of iterations being generated and the number of moves to
>>mate?
>>Jim Walker
>
>max (longest DTC when white wins,
>     2*(longest DTC when black wins))
>+ 1 iterations.
>
>Eugene

	So it is not directly related to the distance to mate, but to the distance to
conversion (most times they are different).
José.



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.