🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: gnu.chess
Article #5211

Gnuchess fixed depth evaluations

#5211
From: Dr Michael J. White
Date: Wed, 19 Jan 1994 04:43
64 lines
2830 bytes
>From md85-epi@nada.kth.se Tue Jan 18 07:19:54 1994
Return-Path: <md85-epi@nada.kth.se>
Date: Tue, 18 Jan 94 14:13:53 +0100
From: md85-epi@nada.kth.se
Message-Id: <9401181313.AA20822@hemul.nada.kth.se>
To: mwhite@osiris.cso.uiuc.edu
Subject: Gnuchess, evaluation

I could not post this reply (device full).
If you would post it and maybe others in a summary I'd be most
grateful.

Your article/letter follows:
Newsgroups: gnu.chess
Subject: Re: Gnuchess fixed depth evaluations
Keywords: Gnuchess, evaluation
References: <2h7mvm$k3d@vixen.cso.uiuc.edu>
Organization: Royal Institute of Technology, Stockholm, Sweden

In <2h7mvm$k3d@vixen.cso.uiuc.edu> mwhite@osiris.cso.uiuc.edu (Dr Michael J. White) writes:

>Gnuchessers:

>I've noticed the following, and can find no explanation for this:

>Set the depth for gnuchess evaluations to, say, 6 ply.
>Now set post and go to evaluate a position.
>This should yield some score and a best move.

>Now in the new position, set the depth to one fewer ply, 5.
>Again, press "go" and watch for a score.
>Compare the new score with the old one.

>They're different!   Why?

There are some possibilities:

* GNU Chess chose parameters for the evaluation function depending
  on the current position.

* GNU Chess add a random number as part of the evaluation function.
  (This can be turned off)

* The evaluation function depend at least partly on the Alpha-Beta
  interval. If a fast approximation is outside the interval by a
  large enough margin, the slower evaluation is not used.

* The order of the moves depend on the killer move heuristic as well
  as the history heuristic. The order the game tree is searched
  depend on what has been searched before.

>This doesn't always happen.  The scores (accounting for
>who goes next times minus one) are usually within about 1/10
>of a pawn.  But shouldn't they be exactly the same?

I think my first reason is the most important one.

>By the way, book is off, transposition table is off.

You could turn random off too.

>Mike White

Urban Koistinen - md85-epi@nada.kth.se
Technical Details
Message-ID: <9401190430.AA06322@pancake>
Path: arc1-ca.pugleaf.net!gmd.de!xlink.net!rz.uni-karlsruhe.de!news.uni-stuttgart.de!news.belwue.de!zib-berlin.de!netmbx.de!Germany.EU.net!EU.net!howland.reston.ans.net!math.ohio-state.edu!cis.ohio-state.edu!osiris.cso.uiuc.edu!mwhite

Show Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 10d71d,2e9c1a08c651a388
X-Google-Attributes: gid10d71d,public
X-Google-ArrivalTime: 1994-01-19 06:42:03 PST
Path: arc1-ca.pugleaf.net!gmd.de!xlink.net!rz.uni-karlsruhe.de!news.uni-stuttgart.de!news.belwue.de!zib-berlin.de!netmbx.de!Germany.EU.net!EU.net!howland.reston.ans.net!math.ohio-state.edu!cis.ohio-state.edu!osiris.cso.uiuc.edu!mwhite
From: mwhite@osiris.cso.uiuc.edu (Dr Michael J. White)
Newsgroups: gnu.chess
Subject: Gnuchess fixed depth evaluations
Date: 18 Jan 1994 23:43:16 -0500
Organization: University of Illinois at Urbana
Lines: 66
Sender: daemon@cis.ohio-state.edu
Distribution: gnu
Message-ID: <9401190430.AA06322@pancake>