Computer Chess Club Archives

Search

Messages

Subject: Re: Ply 'n+1' searches lesser nodes than 'n'

Author: Nagendra Singh Tomar

Date: 23:00:06 10/27/02

Go up one level in this thread

On October 28, 2002 at 01:48:02, Ricardo Gibert wrote:

>On October 28, 2002 at 01:17:41, Nagendra Singh Tomar wrote:
>
>>What all reasons can you think of for a ply 'n+1' searching lesser nodes than
>>ply 'n' search.
>>
>>regds
>>tomar
>
>The most obvious is a ply n search had really bad move ordering that gets much
>improved for ply n+1 thanks to the hash moves saved in the hash table.

correct.

One more reason can ne that 'n' was just small enough to deny null-move.
null-move in 'n+1' ply search saved a lot of nodes.

• Re: Ply 'n+1' searches lesser nodes than 'n' Uri Blass 23:45:33 10/27/02
  • Re: Ply 'n+1' searches lesser nodes than 'n' Nagendra Singh Tomar 01:24:24 10/28/02
    • Re: Ply 'n+1' searches lesser nodes than 'n' Uri Blass 01:52:26 10/28/02
      • Re: Ply 'n+1' searches lesser nodes than 'n' Nagendra Singh Tomar 02:02:13 10/28/02
        • Re: Ply 'n+1' searches lesser nodes than 'n' Uri Blass 02:47:32 10/28/02
        • Re: Ply 'n+1' searches lesser nodes than 'n' José Carlos 02:28:39 10/28/02
          • Re: Ply 'n+1' searches lesser nodes than 'n' Christophe Theron 09:45:11 10/28/02
            • Re: Ply 'n+1' searches lesser nodes than 'n' Robert Hyatt 10:14:48 10/28/02

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.