Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Programmers: beginner tree search questions

Author: Gian-Carlo Pascutto

Date: 15:05:50 09/30/03

Go up one level in this thread


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.

But for a beginner, things like this should be avoided since it gets complicated
fast.

--
GCP



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.