Author: Christophe Theron
Date: 16:45:35 07/30/04
Go up one level in this thread
On July 29, 2004 at 17:40:23, Daniel Clausen wrote:
>On July 29, 2004 at 17:34:11, Christophe Theron wrote:
>
>>On July 29, 2004 at 14:07:10, Robert Hyatt wrote:
>>
>>>On July 29, 2004 at 06:26:52, Gian-Carlo Pascutto wrote:
>>>
>>>>http://arxiv.org/ftp/cs/papers/0406/0406038.pdf
>>>>
>>>>I stumbled onto this when doing a search for Axon.
>>>>Not seen it mentioned here yet.
>>>>
>>>>They also have a paper about hashing out which I can't
>>>>download.
>>>>
>>>>--
>>>>GCP
>>>
>>>
>>>Doesn't strike me as particularly interesting. IE it almost seems that they
>>>don't realize that most programs store positions in a repetition list as 64 bit
>>>Zobrist integers...
>>
>>
>>
>>Actually I think it might be interesting.
>>
>>Recently, when I was rewriting the core of the Chess Tiger engine, I realized
>>that I could get even more speed by not computing the hash keys during the
>>quiescence search for example.
>>
>>In my case, it would have meant some more changes in the engine and the way I do
>>QSearch. But for some programs, it could be interesting.
>>
>>The problem then is how do you check for repetitions?
>
>Based in earlier posts of Bob concerning QSearch, I would assume he couldn't
>care less about repetitions in QSearch, as QSearch is wrong in so many cases
>anyway. :)
And maybe Bob is wrong and Crafty would be much stronger if it has a better
QSearch...
Christophe
>[snip]
>
>
>>Now I should write a paper. :)
>
>But not before you put baby tiger to bed and sing a lullaby for her. :)
>
>Sargon
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.