Author: Bruce Cleaver
Date: 04:36:36 01/06/00
Go up one level in this thread
Hello Fernando! I enjoy your posts. From the description you gave here, and that available from the Paderborn site (9th WCCC), I'd say that the search resembles the B* search developed by Hans Berliner. It takes a set of moves and an error bounds (realistic, optimistic & pessimistic) and attempts to narrow the range between the realistic & the other two values. Bruce
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.