Computer Chess Club Archives

Search

Messages

Subject: Re: beating TSCP too! interesting game.

Author: David Rasmussen

Date: 11:38:07 01/08/01

Go up one level in this thread

On January 08, 2001 at 13:21:53, Uri Blass wrote:

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

You don't have to generate moves to calculate mobility. You can just use
attackboards of some kind.

• Re: beating TSCP too! interesting game. (What's an attackboard?) Severi Salminen 14:26:57 01/08/01
  • Re: beating TSCP too! interesting game. (What's an attackboard?) Dan Andersson 14:57:47 01/09/01
  • Re: beating TSCP too! interesting game. (What's an attackboard?) David Rasmussen 00:21:23 01/09/01
    • Re: beating TSCP too! interesting game. (What's an attackboard?) Severi Salminen 00:25:49 01/09/01
      • Re: beating TSCP too! interesting game. (What's an attackboard?) David Rasmussen 03:37:54 01/09/01
        • Re: beating TSCP too! interesting game. (What's an attackboard?) Severi Salminen 05:14:55 01/09/01
          • Re: beating TSCP too! interesting game. (What's an attackboard?) Uri Blass 08:06:16 01/09/01

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.