Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Null-Move: Difference between R = 2 and R = 3 in action

Author: Uri Blass

Date: 22:29:38 07/20/02

Go up one level in this thread


On July 20, 2002 at 22:20:29, Robert Hyatt wrote:

>On July 20, 2002 at 05:55:43, Uri Blass wrote:
>
>>On July 20, 2002 at 05:47:38, Gian-Carlo Pascutto wrote:
>>
>>>On July 20, 2002 at 02:52:11, Uri Blass wrote:
>>>
>>>>My question was not about comparing using hash tables
>>>>and not using hash tables but about comparing using hash tables
>>>>in the normal way and using hash tables
>>>>for all purposes except pruning.
>>>
>>>In the example given, the move ordering from hashtable is almost
>>>irrelevant, so all the gains are due to pruning.
>>>
>>>--
>>>GCP
>>
>>I did not ask about single example from endgame but about
>>the middle game or about rating improvement.
>>
>>Uri
>
>
>I gave you an answer of sorts.  Best case is fine 70.  3x as many plies.
>Middlegame seems to be a factor of 2x in terms of time to reaching a specific
>depth.  So a fraction of a ply.  So from early middlegame to endgame sees this
>go from a fraction of a ply to (say) 30 additional plies...
>
>The 30 is important.  It doesn't just happen in fine 70.  It happens in lots
>of important king and pawn endings.

I know that in simple endgames you can get big improvement thanks to using hash
tables for pruning.

I also know that you can get a factor of 2 in the middle game from hash tables
when the comparison is between using hash tables and not using them.

It did not answer my questions.

Only Christophe answered them when he explained that I may get 10% speed
improvement in the middle game from pruning.

Uri



This page took 0.45 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.