Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: beating TSCP too! interesting game.

Author: José Carlos

Date: 05:08:41 01/08/01

Go up one level in this thread


On January 08, 2001 at 08:01:06, Severi Salminen wrote:

>>>My program (it does not have a name yet) beat TSCP too! at the end of the
>>>message there is the game which looks interesting.
>>>
>>
>>Forgot to say, game was played on a AMD-K6-II 400 mhz both programs
>>run in Winboard, game in 60 minutes.
>
>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 :)

  José C.

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