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

Re: Beating MTD(n,f) Robert Hyatt 12:41:15 06/05/01
- Re: Beating MTD(n,f) Dan Andersson 13:03:22 06/05/01
  - Re: Beating MTD(n,f) Vincent Diepeveen 16:42:08 06/05/01
    - Re: Beating MTD(n,f) Dan Andersson 02:05:28 06/06/01
      - Re: Beating MTD(n,f) Gian-Carlo Pascutto 03:25:40 06/06/01
        
        Re: Beating MTD(n,f) Dan Andersson 08:51:58 06/06/01
        
        Re: Beating MTD(n,f) Vincent Diepeveen 06:06:40 06/06/01
        
        Re: Beating MTD(n,f) Gian-Carlo Pascutto 07:32:14 06/06/01
        
        Re: Beating MTD(n,f) Tony Werten 03:52:07 06/07/01
        
        Re: Beating MTD(n,f) Gian-Carlo Pascutto 03:07:16 06/08/01
        
        Re: Beating MTD(n,f) Robert Hyatt 14:16:21 06/07/01
        
        Re: Beating MTD(n,f) Dann Corbit 13:04:49 06/07/01
        
        Re: Beating MTD(n,f) Tony Werten 00:44:44 06/08/01
        
        Re: Beating MTD(n,f) Dan Newman 02:06:25 06/08/01
        
        Re: Beating MTD(n,f) Tony Werten 03:45:40 06/08/01
        
        Re: Beating MTD(n,f) Dan Andersson 09:46:06 06/08/01
        
        Re: Beating MTD(n,f) Miguel A. Ballicora 08:08:04 06/08/01
        
        Re: Beating MTD(n,f) Andrew Williams 07:12:36 06/06/01
Re: Beating MTD(n,f) isn't MTD-best a candidate. (NT) Dan Andersson 12:38:53 06/05/01
- Re: Beating MTD(n,f) isn't MTD-best a candidate. (NT) Dann Corbit 12:41:35 06/05/01
  - Re: Beating MTD(n,f) isn't MTD-best a candidate. (NT) Tony Werten 23:32:47 06/05/01
    - Re: Beating MTD(n,f) isn't MTD-best a candidate. (NT) Bas Hamstra 02:20:55 06/07/01
      - Re: Beating MTD(n,f) isn't MTD-best a candidate. (NT) Tony Werten 02:59:05 06/07/01
        
        Re: Beating MTD(n,f) isn't MTD-best a candidate. (NT) Bas Hamstra 05:36:05 06/07/01
  - Re: Beating MTD(n,f) isn't MTD-best a candidate. (NT) Dan Andersson 12:55:46 06/05/01
    - Re: Beating MTD(n,f) isn't MTD-best a candidate. (NT) Gian-Carlo Pascutto 13:17:36 06/05/01
      - Re: Beating MTD(n,f) isn't MTD-best a candidate. (NT) Dan Andersson 13:21:22 06/05/01

This page took 0.02 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.