Computer Chess Club Archives


Search

Terms

Messages

Subject: reducing null-move searches

Author: Alessandro Damiani

Date: 05:10:51 11/17/97


Hello!

Before searching the null-move or doing any form of forward pruning, I
think it should be faster if we test whether evaluate(position)>=beta.
Since I own a slow machine (MC68020) I would like to know how it works
with deep search (in the middle game). Any comments?

Bye

Alessandro



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.