Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Programmers: beginner tree search questions

Author: Uri Blass

Date: 16:19:26 09/30/03

Go up one level in this thread


On September 30, 2003 at 18:05:50, Gian-Carlo Pascutto wrote:

>If you only have 3 possible scores, I don't think the issue of having to
>research actually plays. You center around 0. If you get a score back, it's 0.
>If you fail high, the score must necessarily be +9999. If you fail low, it's
>necessarily -9999. No need to resolve anything.
>
>The original poster was correct there will be more cutoffs (I think), and if
>the goal is to solve the game, this may be a good optimization.

I have no exprience in programs that the target is to solve the game
but I doubt if no evaluation function except checkmate
is really the fastest way.

Intuition tells me that you may get bad order of moves.
The problem is that with evaluation you may have first move that lead to
evaluation of +7 pawns for white when without evaluation -7 and 7 are the same
if you do not see checkmate so you may start with the wrong move.

Uri



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.