Computer Chess Club Archives

Search

Messages

Subject: Quiescent search question to programmers

Author: Russell Reagan

Date: 12:43:37 03/09/03

I think that most people subscribe to the school of thought that says that
quiescent search is not perfect, so do it fast and "good enough" for most
situations. If you could have a perfect quiescent search, what price would you
be willing to pay? One ply of full width search? Two ply? Time to depth takes
twice as long? I am interested what programmers with more experience than myself
think about this.

• Re: Quiescent search question to programmers Robert Hyatt 18:43:41 03/09/03
• Re: Quiescent search question to programmers Ulrich Tuerke 14:56:55 03/09/03
  • Re: Quiescent search question to programmers Uri Blass 15:13:31 03/09/03
    • Re: Quiescent search question to programmers Ulrich Tuerke 18:36:00 03/09/03
      • Re: Quiescent search question to programmers Uri Blass 23:55:17 03/09/03
        • Re: Quiescent search question to programmers Ulrich Tuerke 05:07:35 03/10/03
          • Re: Quiescent search question to programmers Uri Blass 05:30:40 03/10/03
• Re: Quiescent search question to programmers Uri Blass 13:03:45 03/09/03
  • Re: Quiescent search question to programmers Robert Hyatt 20:29:15 03/09/03
    • Re: Quiescent search question to programmers Tony Werten 08:14:43 03/10/03
      • Re: Quiescent search question to programmers Robert Hyatt 13:08:20 03/10/03
  • Re: Quiescent search question to programmers Russell Reagan 13:36:01 03/09/03
    • Re: Quiescent search question to programmers Uri Blass 13:59:28 03/09/03

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.