Computer Chess Club Archives

Search

Messages

Subject: Re: Measuring closeness to a minimal tree

Author: Dan Andersson

Date: 07:00:36 04/06/03

Go up one level in this thread

 How could you ever get a measure of the minimal graph if you disregard
transpositions? A-B withot memory is just a curio. One way of looking at
transpositions is as compression.

MvH Dan Andersson

• Re: Measuring closeness to a minimal tree Ian Kennedy 07:08:30 04/06/03
  • Re: Measuring closeness to a minimal tree Dan Andersson 07:12:16 04/06/03
• Re: Measuring closeness to a minimal tree Vincent Diepeveen 07:08:21 04/06/03
  • Re: Measuring closeness to a minimal tree Dan Andersson 07:34:14 04/06/03
    • Re: Measuring closeness to a minimal tree Vincent Diepeveen 12:25:11 04/06/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.