Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Measuring closeness to a minimal tree

Author: Ian Kennedy

Date: 07:08:30 04/06/03

Go up one level in this thread


On April 06, 2003 at 10:00:36, Dan Andersson wrote:

> 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

The formulae I have read don't take account of it so neither do I.



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.