Computer Chess Club Archives

Search

Messages

Subject: Re: Measuring closeness to a minimal tree

Author: Dan Andersson

Date: 12:51:50 04/07/03

Go up one level in this thread

 Problem was that what you have suggested is suboptimal. Why they are
suboptimal, improvements and fundamental problems are discussed in those papers.
Why not use the knowledge already accumulated instead of starting from scratch?
Nothing wrong with being sceptical of prior work. But to be ingnorant of them is
wasteful.

MvH Dan Andersson

• Re: Measuring closeness to a minimal tree Sune Fischer 13:32:10 04/07/03
  • Re: Measuring closeness to a minimal tree Bo Persson 04:30:24 04/08/03
    • Re: Measuring closeness to a minimal tree Vincent Diepeveen 14:07:07 04/09/03
    • Re: Measuring closeness to a minimal tree Sune Fischer 09:02:09 04/08/03
      • Re: Measuring closeness to a minimal tree Vincent Diepeveen 14:12:16 04/09/03

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.