Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Detecting Draws using a Small Hash Table?

Author: Uri Blass

Date: 21:51:26 02/21/02

Go up one level in this thread


On February 21, 2002 at 20:19:42, Antonio Dieguez wrote:

>On February 21, 2002 at 20:16:42, Antonio Dieguez wrote:
>
>>On February 21, 2002 at 08:49:58, Sune Fischer wrote:
>>
>>[snip]
>>>BTW: are you using a UnMakeMove function or do you use a backup?
>>>I do a backup, seems both faster and simpler than to unmake the move, I'm a
>>>little confused as to why some would unmake.
>>
>>because unmake is faster for them.
>>
>>when I implemented an unmake instead of using a backup I got a speed up of 20%.
>>I wish it were the other way but my ugly unmake is just faster for me.
>>
>>a.
>
>well actually at least 20%, it went to almost 90% sometimes.
>
>love and peace.

I believe that it is not going to be faster for me.
I believe that calculating the new attack tables in unmake cannot be faster than
backup for my program but I did not try so I do not know.

Uri



This page took 0.02 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.