Author: Tord Romstad
Date: 12:08:18 02/05/04
Go up one level in this thread
On February 05, 2004 at 14:35:56, Robert Hyatt wrote: >I can think of a dozen exceptions. Rook at e1, bishop at f1, but the bishop at >f1 can't move as my pawn at g2 is attacked twice by my opponent. Etc... I >simply hope the search is up to sorting those kinds of details out, where years >ago I had to evaluate them due to the shallow search depths we were getting. I suppose that is the true reason for our apparent disagreement -- Unlike you, I still get these shallow search depths. My engine is probably reaches depths comparable to those you got ten or fifteen years ago. In addition, we have quite different goals: You want to have an engine which "scales upwards" and is able to take advantage of very fast multiprocessor machines. I am more interested in developing an engine which "scales downwards" and plays reasonably well even on slow handheld devices. Tord
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.