Computer Chess Club Archives

Search

Messages

Subject: Re: A New Approach to Draw Detection by Move Repetition in Computer Ches

Author: Dan Andersson

Date: 04:21:03 07/29/04

Go up one level in this thread

 There are whole hosts of approaches to repetition. One I thought of but never
implemented was a Bloom filter. It could either be used as is and accept false
positives. Or a more costly comparision could be made.

MvH Dan Andersson

• Logic of implementation. Dan Andersson 02:35:45 07/30/04
  • Re: Logic of implementation. Dan Andersson 02:39:23 07/30/04
    • Re: Logic of implementation. Dan Andersson 02:55:56 07/30/04
• Re: A New Approach to Draw Detection by Move Repetition in Computer Ches Ricardo Gibert 00:27:09 07/30/04
  • Re: A New Approach to Draw Detection by Move Repetition in Computer Ches Dan Andersson 01:35:05 07/30/04
• Re: A New Approach to Draw Detection by Move Repetition in Computer Ches Walter Faxon 20:27:56 07/29/04
  • Re: A New Approach to Draw Detection by Move Repetition in Computer Ches Dan Andersson 21:16:07 07/29/04
    • Thanks, Dan! NT Walter Faxon 22:34:16 07/29/04

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.