Computer Chess Club Archives

Search

Terms

Messages

Subject: Re: beating TSCP too! interesting game.

Author: Uri Blass

Date: 07:30:18 01/08/01

On January 08, 2001 at 08:21:50, Severi Salminen wrote:

>>>Congratulations, doesn't it feel good! It was me who "first" beat TSCP. One
>>>question (I'm not familiar with terminology): what is "Hash table for refutation
>>>and transposition"? Is this the normal hash table in all programs (not in mine
>>>yet). I understand the "transposition", but what is "refutation"?
>>>
>>>And have you tried your program's evaluation without mobility factor? It should
>>>make it faster and maybe without affecting the precision of your eval(). Try it
>>>and if possible make 200 or more games (verison with mobility vs. version
>>>without) and report here at CCC. It would be very interesting to see results!
>>
>>  I have mobility in Averno and, when I take it out, the program seems to become
>>instantly stupid. Actually, it's much weaker (~150 ELO) without mobility in its
>>eval. Maybe I'd need a better overall eval to be able to take mobility out, I
>>don't know, but I can assure that, right now, I can't live without mobility :)
>
>
>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.

> This sounds very time consuming.

It does not sound time consuming to me.

Dark thought is one of the programs that use mobility in it's evaluation and I
guess that all top programs use mobility(I know that part of them has mobility
as one of the parameters that you can change).

Uri

Re: beating TSCP too! interesting game. Severi Salminen 09:49:09 01/08/01
- Re: beating TSCP too! interesting game. Uri Blass 10:21:53 01/08/01
  - Re: beating TSCP too! interesting game. David Rasmussen 11:38:07 01/08/01
    - 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
  - Re: beating TSCP too! interesting game. Severi Salminen 10:41:43 01/08/01
    - Re: beating TSCP too! interesting game. Uri Blass 11:23:48 01/08/01
      - Re: beating TSCP too! interesting game. Landon Rabern 17:05:50 01/08/01
        
        Re: beating TSCP too! interesting game. Dann Corbit 17:31:02 01/08/01
        
        Re: beating TSCP too! interesting game. David Rasmussen 00:24:53 01/09/01
        
        Re: beating TSCP too! interesting game. Dann Corbit 00:42:09 01/09/01
        
        Re: beating TSCP too! interesting game. José Carlos 23:37:22 01/08/01
        
        Re: beating TSCP too! interesting game. Landon Rabern 21:20:30 01/08/01

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.