Author: Nobuhiro Yoshimura
Date: 17:54:52 04/05/00
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.
This page took 0.01 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.