Computer Chess Club Archives


Search

Terms

Messages

Subject: Beating MTD(n,f)

Author: Gian-Carlo Pascutto

Date: 12:14:20 06/05/01


I'm wondering if, for material only fixed-depth searches,
there is any way to beat MTD(n,f) in terms of perfomance.

I'm interested in positions where the value at the root
and the expected value are on the order of -1..0..1 pawns.

For the starting position, MTD will do 2 zero window
searches.

How can you beat that? It already searches _below_ the
minimal tree. With ETC you're even getting close to the
_real_ minimal tree. You can't go faster, right?

--
GCP



This page took 0.08 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.