Computer Chess Club Archives

Search

Terms

Messages

Subject: Re: Repeatability (questions for Omid)

Author: Martin Giepmans

Date: 17:34:58 12/18/02

<snip>
>The tactical strength is not affected by the re-searches. They merely help >avoid
>zugzwangs.

This is not true, Omid.
Nullmove pruning often overlooks tactical (and positional) threats
that are not related to zugzwang. Because of that some programmers use
(standard) verification search in every phase of the game.

Cheers,
Martin

Re: Repeatability (questions for Omid) Omid David Tabibi 17:42:09 12/18/02
- Re: Repeatability (questions for Omid) Martin Giepmans 18:19:47 12/18/02
  - Re: Repeatability (questions for Omid) Omid David Tabibi 18:25:36 12/18/02
    - Re: Repeatability (questions for Omid) Martin Giepmans 18:44:09 12/18/02
      - Re: Repeatability (questions for Omid) Omid David Tabibi 18:51:20 12/18/02
        
        Re: Repeatability (questions for Omid) Martin Giepmans 19:19:24 12/18/02
        
        Re: Repeatability (questions for Omid) Uri Blass 22:46:01 12/18/02
        
        Re: Repeatability (questions for Omid) Dan Andersson 05:56:45 12/19/02
        
        Re: Repeatability (questions for Omid) Gian-Carlo Pascutto 06:39:54 12/20/02
        
        Re: Repeatability (questions for Omid) Vincent Diepeveen 15:59:41 12/20/02
        
        Re: Repeatability (questions for Omid) Dan Andersson 16:27:29 12/20/02
        
        Re: Repeatability (questions for Omid) Martin Giepmans 05:47:02 12/19/02
        
        Re: Repeatability (questions for Omid) Uri Blass 05:57:50 12/19/02
        
        Re: Repeatability (questions for Omid) Martin Giepmans 06:32:40 12/19/02
        
        Re: Repeatability (questions for Omid) Uri Blass 06:49:00 12/19/02
        
        Re: Repeatability (questions for Omid) Martin Giepmans 07:40:43 12/19/02

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