Computer Chess Club Archives

Search

Terms

Messages

Subject: Re: Verified Null-Move Pruning, ICGA 25(3)

Author: Gian-Carlo Pascutto

Date: 12:58:06 11/26/02

On November 26, 2002 at 15:55:56, Omid David Tabibi wrote:

>So it is reasonable that on every program starting from a certain depth >adaptive null-move pruning will always construct a smaller search tree.

Don't you mean the other way around?

--
GCP

Re: Verified Null-Move Pruning, ICGA 25(3) Omid David Tabibi 13:21:00 11/26/02
- Re: Verified Null-Move Pruning, ICGA 25(3) Robert Hyatt 17:02:06 11/26/02
  - Re: Verified Null-Move Pruning, ICGA 25(3) Frank Phillips 10:48:50 11/27/02
    - Re: Verified Null-Move Pruning, ICGA 25(3) Robert Hyatt 12:15:50 11/27/02
      - Re: Verified Null-Move Pruning, ICGA 25(3) Tony Werten 13:53:29 11/27/02
        
        Re: Verified Null-Move Pruning, ICGA 25(3) Robert Hyatt 17:08:42 11/28/02
        
        Re: Verified Null-Move Pruning, ICGA 25(3) Tony Werten 14:54:51 11/29/02
        
        Re: Verified Null-Move Pruning, ICGA 25(3) Omid David Tabibi 05:46:06 11/29/02
        
        Re: Verified Null-Move Pruning, ICGA 25(3) Robert Hyatt 08:20:59 11/29/02
      - Re: Verified Null-Move Pruning, ICGA 25(3) Uri Blass 12:55:04 11/27/02
        
        Re: Verified Null-Move Pruning, ICGA 25(3) Omid David Tabibi 13:07:54 11/27/02
      - Re: Verified Null-Move Pruning, ICGA 25(3) Frank Phillips 12:36:31 11/27/02
        
        Re: Verified Null-Move Pruning, ICGA 25(3) Omid David Tabibi 12:54:26 11/27/02
        
        Re: Verified Null-Move Pruning, ICGA 25(3) Frank Phillips 13:54:10 11/27/02
  - Re: Verified Null-Move Pruning, ICGA 25(3) Omid David Tabibi 18:47:00 11/26/02
    - Re: Verified Null-Move Pruning, ICGA 25(3) Robert Hyatt 21:12:19 11/26/02
      - Re: Verified Null-Move Pruning, ICGA 25(3) Omid David Tabibi 21:43:35 11/26/02

This page took 0.01 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.