Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Building the Principal Variation in MTD(f) searches

Author: Dan Andersson

Date: 17:01:43 07/19/99

Go up one level in this thread


In essence correct. There is also a sorting of evaluation factors, importance
and computational cost. The simplest is a nonpermutable linear list w. a kind of
pointer.

DAn.



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.