Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Search algorithms and effeciency

Author: Vincent Diepeveen

Date: 02:51:26 05/31/01

Go up one level in this thread


On May 31, 2001 at 05:50:19, Vincent Diepeveen wrote:

>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

I'm clearly not awake yet.

I'm using a nullwindow search - PVS (principal variation search)



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.