Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Example for the potential of the new Botvinik-Makaroff-Threat-Extens

Author: Tord Romstad

Date: 07:39:27 10/02/03

Go up one level in this thread


On October 02, 2003 at 10:30:35, Grzegorz Sidorowicz wrote:

>I think in this position it is very impoprtant.
>My program without checks in qsearch is slow as turtle in honey.
>In other words without it this positions are impossible to solve by Armageddon.
>Checks in qsearch are vey important. I don't know why people not use it in
>qsearch. Program with it can be slow of course but I not use it always.
>I use it always in lines where are many checks, because there are important.
>This formula is only a little slower than qsearch without checks.

I agree.  I have experimented with removing checks from my qsearch many times,
but the result is always a clearly weaker program.  Without the checks, I get
totally crushed tactically.

My program is rather slow.  Perhaps a minimalistic qsearch works better in very
fast programs like Crafty?

Tord



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.