Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Optimal stopping in chess program

Author: Robert Henry Durrett

Date: 06:33:22 09/01/98

Go up one level in this thread


On August 31, 1998 at 23:07:19, Dave Gomboc wrote:
<snip>
>
>Yngvi Bjornsson at the University of Alberta has already investigated
>tree-pruning work along these lines.  I don't recall if he's published anything
>yet but I know I saw a draft of something first hand earlier this year.
>
>Dave Gomboc

When you put it that way, suddenly it becomes clear that maybe there's not so
much difference between chess engines and chess database software afterall.  In
other words, chess engines can be thought of as "tree generators" and "tree
pruners."  This is similar to the way the creation of opening books is a "tree
generation" activity.  And,. . . opening book maintenance is a process involving
"tree pruning" among other things.  Creation and processing of very large
databases of chess games is also not much different from working with opening
books, but on a larger scale.  By looking at things this way, it seems that the
whole subject of chess software all ties to together into similar activities.



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.