Author: Bruce Moreland
Date: 10:16:11 02/17/99
Go up one level in this thread
On February 17, 1999 at 12:28:07, Steve Maughan wrote: >What do you think the penalty would be of allowing you program to search 60+ ply >in nomal play ie what is the difference in strength between the version that >solves it in 0.09 sec and 32 sec? Usually it works fine, but sometimes you get into these situations where you end up searching three plies in a minute. I think the one that finds it slower is better, but I don't have an Elo estimate. 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.