Author: Dave Gomboc
Date: 12:16:09 06/19/00
Go up one level in this thread
On June 19, 2000 at 07:25:54, Gian-Carlo Pascutto wrote: >On June 18, 2000 at 18:39:27, Ed Schröder wrote: > >> >>Infamous examples are these blocked pawn-endings where programs may >>hit 30 plies or deeper within a few seconds. If you then get a fail-high >>on iteration 40 (or so) it in extreme cases can take hours to resolve the >>fail-high. > >I seem to recall Schaeffer once published some results to illustrate >that you should restart the search in that case, so iterative deepening >can get the move ordering right again. That was for a fail low. Dave
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.