Computer Chess Club Archives

Search

Messages

Subject: Re: MTD(f)

Author: Peter Alloysius

Date: 21:08:15 07/26/04

Go up one level in this thread

On July 26, 2004 at 23:28:04, Stuart Cracraft wrote:

>I visited Aske Plaat's site and slapped MTD(f) into my
>program, keeping the existing PVS/NEGASCOUNT in lieu of implementing
>his AlphaBetaWithMemory(). This is perfectly okay according to Aske.
>

you should implement his AlphaBetaWithMemory(), or your program will take
9999999 iterations to find mate value. If value found by alphabeta is above beta
or below alpha, return that real value, not the alpha/beta.

• Re: MTD(f) Stuart Cracraft 18:38:42 07/27/04
  • Re: MTD(f) Peter Alloysius 06:04:16 07/28/04
    • Re: MTD(f) Stuart Cracraft 07:55:55 07/31/04
    • Re: MTD(f) Stuart Cracraft 09:08:17 07/28/04
      • Re: PVS/NegaScout Fabien Letouzey 09:15:01 07/28/04
        • Re: PVS/NegaScout Stuart Cracraft 07:53:07 07/31/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.