Computer Chess Club Archives

Search

Terms

Messages

Subject: PVS and MTD(f)---[Complete beginner's question.......]

Author: George Tsavdaris

Date: 05:03:07 01/18/06

 I'm about to complete the learning of C and i have just started to read all of
these AB-search,Tranposition table,PVS,Negascout,SSS, etc....

 I'm about to learn the PVS and MTD(f) right now and from what i read from CCC
all these years(without having that years too much concentration on what i was
reading about programming), i had the impression that almost all programs today
use PVS instead of MTD-f and that PVS is superior to MTD-f. BUT here:
http://en.wikipedia.org/wiki/MTD-f  and at the very end of the page it says:

"Implementations of the MTD(f) algorithm had been proven to be better than other
search algorithms (e.g. Negascout) in games such as chess."

Is this true (today) and if yes about what implementations he refers to....?

Re: PVS and MTD(f)---[Complete beginner's question.......] Vasik Rajlich 05:15:28 01/19/06
Re: PVS and MTD(f)---[Complete beginner's question.......] Dan Honeycutt 13:20:57 01/18/06
- Re: PVS and MTD(f)---[Complete beginner's question.......] Joachim Rang 15:06:18 01/18/06
Re: PVS and MTD(f)---[Complete beginner's question.......] Gian-Carlo Pascutto 05:21:02 01/18/06
Re: PVS and MTD(f)---[Complete beginner's question.......] Alessandro Scotti 05:18:34 01/18/06

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.