Computer Chess Club Archives

Search

Messages

Subject: Re: MTD(f)

Author: Fabien Letouzey

Date: 03:41:43 07/29/04

Go up one level in this thread

On July 29, 2004 at 05:58:20, Tord Romstad wrote:

>Consider the extreme case of having an evaluation function which always
>returns 0.  You automatically get perfect move ordering, and you will
>search really small trees.  Your eval will also be very cheap to
>compute.  On the other hand, it could hurt the engine's positional
>play a bit.  :-)

Tord, don't try to confuse the readers.  You know move ordering would still
affect tree size.

Fabien.

• Re: MTD(f) Tord Romstad 06:00:59 07/29/04
• Re: MTD(f) Uri Blass 05:28:23 07/29/04
  • Re: MTD(f) Fabien Letouzey 05:33:49 07/29/04
    • Re: MTD(f) Uri Blass 05:44:09 07/29/04
  • Re: MTD(f) Uri Blass 05:31:02 07/29/04

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.