Author: Jay Scott
Date: 14:22:50 01/13/98
Go up one level in this thread
On January 13, 1998 at 16:02:53, Don Dailey wrote: >The reason such an obviously good algorithm like square of pawn is not >as big a win as you might intuitively think is that Is that... ? Is that by the time they're near the root the search can solve them anyway? I'm not sure this is true for KN-K. :-) I'm on the edge of my seat! Jay
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.