Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: beating TSCP too! interesting game.

Author: Uri Blass

Date: 10:21:53 01/08/01

Go up one level in this thread


On January 08, 2001 at 12:49:09, Severi Salminen wrote:

>>>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

I guess that it is your mistake.

I do not think that generating moves is slow.

I think that generating moves if you are interested in pseudo legal moves and
not in legal moves is very fast relative to other things that you want to do in
your chess program.

Uri



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.