Author: Andrew Williams
Date: 06:27:45 03/13/00
Go up one level in this thread
On March 13, 2000 at 08:20:11, Jan Pernicka wrote: >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!!!!!) > Hi Jan, My program, PostModernist, uses MTD(f). There are at least two others I know of that use (or used to use) MTD(f): AnMon and Cilian. There's a little bit of information about my program at: http://www.doc.mmu.ac.uk/STAFF/A.Williams/postmodernist/postmodernist.html On that page there's a link to a page by Aske Plaat who explains MTD(f) in detail and gives some pseudocode. > My second question is: How much faster is the incremental evaluation > vs. static evalutaion (i.e. in leaves) - if any. >Thanks, I'm not sure I understand this question. Andrew
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.