Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: a question to Tord about detecting threats in null move

Author: Uri Blass

Date: 11:51:24 10/03/03

Go up one level in this thread


On October 03, 2003 at 13:38:54, Mridul Muralidharan wrote:

>Hi,
>
>  I was a bit taken aback by these declarations :
>
>On October 03, 2003 at 12:47:23, Uri Blass wrote:
>>I prefer even not to care about using hash tables for pruning because my
>>experience told me that I cannot get significant gain there easily
>
>Hash table not giving you pruning ? I suspect a bug in your hashkey -
>nothingelse.
>Or maybe it is the easily that is operative word ?
>I think there are a lot of open source programs that you can refer to and
>correct your bugs with - crafty , GNUChess , etc , etc.
>Might help to get this right.

I do not like to copy from other sources.
I found that instability helped me to do my program significantly better.

If I delete it in order to be able to copy from other programs then I may need
to start by doing it significantly weaker.

>
>
>>(I have a lot
>>of stuff that means that pruning or extension is not defined only by the
>>position).
>
>Where ever possible , I try to make the search behaviour as relevent to the
>current position as possible and not rely on past search.
>Why do you want to do the opposite ?

because the opposite gives me some advantages.
Movei has its chances against every program inspite of having bad order of moves
and bad extensions and bad pruning.

I believe that I can get above Crafty level if I improve order of move
extensions,pruning and evaluation.

Movei already has its chances against Crafty but today crafty is significantly
better.

There is a lot to improve and the main problem is programming.

Uri



This page took 0.11 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.