Computer Chess Club Archives

Search

Terms

Messages

Subject: Researching after a fail-low

Author: J. Wesley Cleveland

Date: 11:43:08 08/17/00

When you have a fail-low in a deep search where the value drops significantly,
finding an alternate move can take a very long time. This is largely because the
values in the hash table are largely useless, so in effect we are researching
the entire tree. It seems to me one should use iterative deepening, and start
from ply 1 again.

Re: Researching after a fail-low Gian-Carlo Pascutto 15:05:41 08/17/00
- Re: Researching after a fail-low Robert Hyatt 06:23:38 08/18/00
  - Re: Researching after a fail-low Gian-Carlo Pascutto 02:57:10 08/19/00
  - Re: Researching after a fail-low J. Wesley Cleveland 10:53:16 08/18/00
    - Re: Researching after a fail-low Dave Gomboc 11:48:43 08/18/00
      - Re: Researching after a fail-low Robert Hyatt 16:06:03 08/18/00
        
        Re: Researching after a fail-low J. Wesley Cleveland 14:02:36 08/19/00
- Re: Researching after a fail-low Vincent Diepeveen 17:07:40 08/17/00
Re: Researching after a fail-low Vincent Diepeveen 14:14:26 08/17/00

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.