Computer Chess Club Archives

Search

Messages

Subject: Re: Search algorithms and effeciency

Author: Vincent Diepeveen

Date: 02:50:19 05/31/01

Go up one level in this thread

On May 30, 2001 at 17:22:10, Dan Andersson wrote:

>Not very many if you use fail-soft a-b, I would think.

in PVS i need at most 1 research indeed.

So i use nullmove window search - PVS

• Re: Search algorithms and effeciency Dan Andersson 05:11:16 05/31/01
  • Re: Search algorithms and effeciency Vincent Diepeveen 09:26:19 05/31/01
    • Re: Search algorithms and effeciency Rudolf Huber 09:47:34 05/31/01
      • Re: Search algorithms and effeciency David Rasmussen 12:35:01 05/31/01
        • Re: Search algorithms and effeciency Dan Andersson 13:45:17 05/31/01
          • Re: Search algorithms and effeciency Rudolf Huber 22:31:26 05/31/01
        • Re: Search algorithms and effeciency Dan Andersson 13:45:04 05/31/01
• Re: Search algorithms and effeciency Vincent Diepeveen 02:51:26 05/31/01

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.