Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: hashing in QS

Author: Uri Blass

Date: 04:28:32 10/20/04

Go up one level in this thread


On October 20, 2004 at 07:20:16, Gian-Carlo Pascutto wrote:

>On October 20, 2004 at 04:44:44, martin fierz wrote:
>
>>On October 20, 2004 at 03:39:31, Gian-Carlo Pascutto wrote:
>>
>>>On October 20, 2004 at 02:27:19, martin fierz wrote:
>>>
>>>>so i want to store the move itself in the hashtable instead of the moveindex
>>>>now, as probably everybody is doing.
>>>
>>>Naah.
>>
>>naah? i think storing the move itself is much more sensible than the moveindex
>>and would have supposed everybody is doing the more sensible thing. at least
>>crafty does it that way. you can avoid generating all moves at all times, which
>>i have to do now.
>
>The speedup from doing so was quite uninteresting, last time I calculated it,
>something like 1% :)

In my case I cannot store an index because the order of my piece list is changed
during the search and the result is that the order of generated moves is changed
so if I get to the same position again the same index may mean a different move.

Uri



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.