Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: QSearch() as PVS() ?

Author: Matthias Gemuh

Date: 09:23:18 01/15/04

Go up one level in this thread


On January 15, 2004 at 10:47:03, Tord Romstad wrote:

>On January 15, 2004 at 10:15:37, Matthias Gemuh wrote:
>
>>Hi Tord,
>>my approach is even more expensive than you think, as I am talking about
>>attacked pieces, not just hanging ones.
>
>You mean all pieces which can be captured, even if they are well defended?
>That sounds truly wild, and makes me wonder how BigLion is even able to
>complete a 3-ply search in less than a few minutes.  :-)
>


I must add that there is no released BigLion with such stuff in it.
At the moment, even well defended pieces feel like fleeing to unattacked
squares.
This shall some day be optimized, of course.

/Matthias.



This page took 0.02 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.