Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: question for programmers

Author: Omid David

Date: 08:39:55 07/24/02

Go up one level in this thread


On July 24, 2002 at 10:04:45, Uri Blass wrote:

>On July 24, 2002 at 09:59:04, Steffen Jakob wrote:
>
>>On July 24, 2002 at 09:50:24, Uri Blass wrote:
>>
>>>On July 24, 2002 at 09:36:33, Slater Wold wrote:
>>>
>>>>On July 24, 2002 at 09:11:54, K. Burcham wrote:
>>>>
>>>>>
>>>>>
>>>>>I am curious how you look at operating systems and the chess software we use,
>>>>>in relation to limitations due to hardware speed increases.
>>>>>
>>>>>do you think the operating systems as we know them can handle the speed
>>>>>increases we will see over the next few years. I would think that there is some
>>>>>sort of limitation that the current operating systems could handle when pushed
>>>>>running a chess program at greater speeds.
>>>>>
>>>>>also the same for chess programs. can the chess code, the way it is written
>>>>>today, function without errors at greater speed increases. what do you see is
>>>>>the limitation of our chess programs when it comes to hardware speed increases?
>>>>
>>>>The only thing I will say on this topic is that I know when *some* engines are
>>>>getting 10M+ nps SEE and null move are going to back fire.
>>>
>>>I do not know it.
>>>
>>>null move without detecting zugzwangs is going to back fire at some speed
>>>but we are not close to that speed.
>>>
>>>I do not believe that with 10M nodes per second null move is going to be counter
>>>productive.
>>>
>>>>
>>>>Of course, some programs like Rebel don't use null move, so they will be
>>>>unaffected.
>>>
>>>I remember from previous post of Ed that the latest Rebel use null move pruning
>>>and null move pruning is more productive at long time control(exactly against
>>>your intuition and the intuition of the deep blue team).
>>>
>>>I believe that today Junior is the only top program that does not use null move
>>>pruning.
>>
>>From the "CSS Sprechstunde" with Christophe Theron:
>>
>>"Eduard Nemeth: Is The Tiger nullmove free (genius is)? Stimmt es, dass der
>>ChessTiger nullmove -frei ist, wie zB. der Genius?
>>
>>CT: Null move is not the major selective search algorithm of Tiger."
>
>I did not say that null move is the only selective search algorithm of the top
>programs.
>
>I only said that all of them except Junior use null move pruning.
>Genius does not use null move pruning but Genius today is not considered as a
>top program.
>
>I am also not sure about hiarcs but I believe that it is using null move
>pruning.
>
>Uri

Rebel also doesn't use null-move pruning [ICCA No.22 Vol.3 1999]



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.