Author: Vincent Diepeveen
Date: 08:36:32 03/26/02
Go up one level in this thread
On March 26, 2002 at 08:29:51, Will Singleton wrote:
>On March 26, 2002 at 01:59:40, Gian-Carlo Pascutto wrote:
>
>>On March 25, 2002 at 19:22:51, Will Singleton wrote:
>>
>>>On March 25, 2002 at 19:09:30, TEERAPONG TOVIRAT wrote:
>>>
>>>>On March 25, 2002 at 18:56:22, Gian-Carlo Pascutto wrote:
>>>>
>>>>>On March 25, 2002 at 18:41:52, TEERAPONG TOVIRAT wrote:
>>>>>
>>>>>>
>>>>>>Hi,
>>>>>>
>>>>>>I've a few questions.
>>>>>>
>>>>>>1. When we extend searching depth,which one should be
>>>>>>stored as hashtable->depth depth or depth+extension?
>>>>>>
>>>>>>
>>>>>>Search(alpha,beta,depth)
>>>>>>{
>>>>>>
>>>>>>Probehash()
>>>>>>if(check) extension+=...
>>>>>>
>>>>>>-Search(-beta,-alpha,depth+extension-1)
>>>>>>
>>>>>>Storehash() => here with depth or depth+extension ???
>>>>>>
>>>>>>}
>>>>>
>>>>>You want things to be consistent. Think about this, is
>>>>>should be easy to figure out for yourself.
>>>>
>>>>I guess u mean depth. Actually,I did a few tests.
>>>>With depth it performs better. However,I don't understand
>>>>the difference.
>>>>
>>>
>>>http://www.seanet.com/~brucemo/topics/topics.htm
>>>or try Ernst Heinz's site, or the Beowulf site.
>>>
>>>Short answer is that you store the current draft (which is depth remaining, or
>>>height above qsearch), which would include the extension.
>>
>>Hmmm? In the 'Search' function he posted, the extension would have to be
>>left out, unless I'm misunderstanding you.
>>
>>--
>>GCP
>
>It seems to be a question of semantics. I simply meant that you include
>extensions when calculating the draft, not that you add it again when storing
>the hash.
>
>Will
the only good approach is extending the move, so the NEXT recursion/iteration
gets the same depth. Not the current position. Obviously that means
that in the current position we store depthleft.
Not depthleft+possibleextension
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.