Computer Chess Club Archives

Search

Messages

Subject: Search Instabilities

Author: David Rasmussen

Date: 03:52:57 01/21/02

What are the best techniques for dealing with the search instabilities of PVS,
null move pruning, hashing and repetitions?

Specifically, is there a way to limit the number of false fail highs at the
root?

/David

• Re: Search Instabilities Robert Hyatt 07:41:39 01/21/02
  • Re: Search Instabilities David Rasmussen 11:27:34 01/21/02
    • Re: Search Instabilities Robert Hyatt 21:44:53 01/21/02
      • Re: Search Instabilities David Rasmussen 00:59:07 01/22/02
        • Re: Search Instabilities Robert Hyatt 07:39:07 01/22/02
          • Re: Search Instabilities David Rasmussen 07:57:47 01/23/02
      • Re: Search Instabilities Uri Blass 22:53:53 01/21/02
        • Re: Search Instabilities Robert Hyatt 07:41:50 01/22/02
        • Re: Search Instabilities José Carlos 00:18:42 01/22/02
          • Re: Search Instabilities Robert Hyatt 07:44:22 01/22/02
  • Re: Search Instabilities Daniel Clausen 07:55:50 01/21/02
    • Re: Search Instabilities Robert Hyatt 21:46:01 01/21/02
      • Re: Search Instabilities Tony Werten 01:43:30 01/22/02
        • Re: Search Instabilities Robert Hyatt 07:46:40 01/22/02
          • Re: Search Instabilities Tony Werten 22:16:13 01/22/02
            • Re: Search Instabilities Ulrich Tuerke 05:28:40 01/23/02
              • got this wrong Ulrich Tuerke 06:06:05 01/23/02
    • Re: Search Instabilities José Carlos 13:11:59 01/21/02
    • Re: Search Instabilities Gian-Carlo Pascutto 08:14:55 01/21/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.