Computer Chess Club Archives

Search

Messages

Subject: Re: Repitition detection

Author: Dan Andersson

Date: 18:03:24 12/27/02

Go up one level in this thread

Ugh! Talk about destroying a nice run time behaviour. Using a 4K hash and a
rehashing scheme uould get you a mean almost identical to one. The algorithm you
describe would probably have a mean close to one also, but the standard
deviation will be horiible to behold. But the missed probe behaviour will be
real bad. Iterating over the move list raises the cost of an error linearly, or
very nearly so. Real stupid. There is no excuse whatsoever to use that
algorithm.

MvH Dan Andersson

• Re: Repitition detection Gerd Isenberg 10:13:39 12/28/02
  • Re: Repitition detection Uri Blass 12:01:24 12/28/02
    • Re: Repitition detection Dieter Buerssner 15:43:33 12/28/02
      • Re: Repitition detection Dieter Buerssner 15:46:59 12/28/02
        • Re: Repitition detection Gerd Isenberg 03:05:33 12/29/02
          • Re: Repitition detection Dieter Buerssner 12:42:36 12/29/02
    • Re: Repitition detection Gerd Isenberg 12:37:27 12/28/02
      • Re: Repitition detection Uri Blass 12:58:55 12/28/02
        • Re: Repitition detection Gerd Isenberg 14:09:21 12/28/02
          • Re: Repitition detection Dan Andersson 14:28:35 12/28/02
            • Re: Repitition detection Dave Gomboc 22:36:18 12/28/02
              • Re: Repitition detection Heiner Marxen 12:07:43 12/29/02
              • Re: Repitition detection Dan Andersson 23:31:24 12/28/02
  • Correction Gerd Isenberg 11:24:35 12/28/02

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.