Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Measuring closeness to a minimal tree

Author: Sune Fischer

Date: 13:32:10 04/07/03

Go up one level in this thread


On April 07, 2003 at 15:51:50, Dan Andersson wrote:

> 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

Could you be perhaps a bit more specific?
In what way is it not optimal, what do you want me to look for, on what page
where?

Otherwise you're sending me off to a find a needle in a haystack.

I'm not even sure we are discussing the same thing, you seem to talk about
theoritical calculations and compressions schemes, and that's not even remotely
connected to the original question.

-S.



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.