Computer Chess Club Archives

Search

Messages

Subject: Re: Measuring closeness to a minimal tree

Author: Vincent Diepeveen

Date: 06:55:19 04/06/03

Go up one level in this thread

On April 06, 2003 at 09:48:56, Ian Kennedy wrote:

>There is no qsearch. What exactly do you mean by 'what evaluation function do
>you use'?

then this renders your experiments to useless, because experiments with a
gametree that suffer from horizon effects which get backupped to the root are
completely useless for obvious reasons.

Why not measure something in the game of 4 connect? No need for a qsearch there.
No need for nullmove.

Only problem you have there is transpositiontable. That's just 1 problem. Easier
than chess.

>Ian

• Re: Measuring closeness to a minimal tree Uri Blass 08:00:25 04/06/03
  • Re: Measuring closeness to a minimal tree Vincent Diepeveen 12:26:34 04/06/03
    • Re: Measuring closeness to a minimal tree Uri Blass 12:36:07 04/06/03
      • Re: Measuring closeness to a minimal tree Vincent Diepeveen 12:39:30 04/06/03
        • Re: Measuring closeness to a minimal tree Uri Blass 14:27:20 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.