Author: Gian-Carlo Pascutto
Date: 04:25:54 06/19/00
Go up one level in this thread
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. >But if your program takes one hour to resolve a (low) 7 ply research than >something is wrong with your search. Something wrong can mean anything from >insufficient move ordering, something is wrong with the HT, maybe even >a bug, perhaps you are doing to much extensions and so on. It's probably due to a too naive HT replacement scheme and maybe even because of the extensions. (one-on-check can be too much in this kind of positions) -- GCP
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.