Author: Robert Hyatt
Date: 08:45:46 06/05/01
Go up one level in this thread
On June 05, 2001 at 07:30:01, Uri Blass wrote: >On June 05, 2001 at 05:40:22, Daniel Clausen wrote: ><snipped> >>I don't know about your engine but a 15-ply search w/o alpha-beta from the >>initial position is.. welp.. out of the question. :) Maybe null-move helps with >>this a lot? > >It is clear that recursive null move helps a lot. > >Uri That isn't the main improvement in MTD however. Programs spend _way_ too much time establishing an upper or lower search bound throughout the tree. MTD(f) does not.
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.