Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: beating TSCP too! interesting game.

Author: Severi Salminen

Date: 09:49:09 01/08/01

Go up one level in this thread


>>Very interesting. When you evaluate a position at leaf node do you have to
>>generate all possible moves for both sides?
>
>I believe that all top programs use mobility in their evaluation.
>
>I do not believe that piece square table is enough because you cannot detect
>passive positions only by piece square table.

Yes, mobility is much more accurate, but...

>> This sounds very time consuming.
>
>It does not sound time consuming to me.

Well, generating moves is slow and if one has to generate moves for _both_ sides
at every node that must be evaluated...it is slow - if done in most obvious way.
And I'd like to know how mobility can be calculated otherwise than generating
all possible moves. Adding mobility (in way I described ) means allmost like
adding 1 ply more work (ok, maybe not...)! But if this is not the case (I
actually don't know how many nodes are actually evaluated in normal middlegame
position compared to all nodes visited...) it would be interesting to see which
version performs better. Maybe I'll give it a try.

Severi



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.