Author: Nobuhiro Yoshimura
Date: 21:45:28 04/05/00
Go up one level in this thread
On April 05, 2000 at 20:57:30, Robert Hyatt wrote: >On April 05, 2000 at 20:54:52, Nobuhiro Yoshimura wrote: > >> I am writing a Japanese Chess program using PVS with iterative deeping and >>hash tables. I often get a fail-low at the root node at the end stage of >>the game. I would like to know how offten do you get fail-lows in >>searching the chess game tree and also what kind of bugs are possible to >>cause many fai-lows. > > >I don't quite understand why you think it is a bug. IE sometimes when you >go a ply deeper, you discover some threat your opponent has that you simply >can't defend against, and the score drops. It is not abnormal... I just thought that since PVS is a good searching algorithm and is being used by many chess programmers that it would not produce many fail-lows that are very bad for search efficincy.
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.