Computer Chess Club Archives


Search

Terms

Messages

Subject: MTD(f) and others

Author: Jan Pernicka

Date: 05:20:11 03/13/00


Hi,
 I would like to know if you have (as a programmers)
some experience with search strategy MTD(f) (I will be able to write a brief
descrition of this strategy soon - if my bus is not coming - as now!!!!!)

  My second question is: How much faster is the incremental evaluation
    vs. static evalutaion (i.e. in leaves) - if any.
Thanks,
            Jan Pernicka



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.