Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Problems implementing hash tables

Author: Ralf Elvsén

Date: 16:21:18 02/11/02

Go up one level in this thread


On February 10, 2002 at 19:49:01, Miguel A. Ballicora wrote:

>I never understood what the people is doing with the mate values, I always
>get confused. I am glad that I came up with my own approach before I asked or
>saw any post about it. :-)
>
>What I do in pseudo code in Gaviota is
>
>search (alpha, beta)
>{
>   adjust_in (&alpha, &beta); /* increments alpha += 1 and beta += 1 if they
>                                are positive mate values, do the opposite if
>                                it is a negative mate value */
>   probe_hashtables_normally()
>
>   loop { /* normal alpha beta stuff */
>    makemove();
>    value = search_moves_for_best_value(-beta, -alpha);
>    unmakemove();
>    best = keep the best value;
>   }
>
>   store_in_hashtables_normally();
>
>   adjust_out(&best); /* decrement best -= 1 if it is a +mate value
>                         increment +=1 if it is a -mate value */
>   return best;
>
>}
>
>And basically, I do not do anything else. I store in the hashtables without
>any change. adjust_out() it is used too when I return early.
>
>Regards,
>Miguel

Here's another one who is doing the same thing :) It is really
simple and clear. My functions are called "upstep" and "downstep" :)

Ralf



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.