Author: Alejandro Dubrovsky
Date: 04:07:06 04/13/02
Go up one level in this thread
On April 12, 2002 at 15:08:51, Gian-Carlo Pascutto wrote: > >Why don't MTD(n,f) searchers have trouble with this? If the >PVS can have a fail high/fail low sequence, couldn't this >happen with MTD(n,f) as well? As far as I see, the result >would be that the MTD quits (it has converged, after all) >and ends up with the move that corresponds to the false-fail >high one in PVS. These are often blunders. Why doesn't this >happen? well, it happens to small potato, and the search is very stable (only instability introduced is because of the hashtable). Blunders are somewhat common. Alejandro.
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.