Author: Bruce Moreland
Date: 23:56:05 02/11/99
Go up one level in this thread
On February 12, 1999 at 01:40:15, Eugene Nalimov wrote: >Sorry, I think that now I remember Anantharamans' threat extension, >and it differs from singular extension... But that extension is >static - he just calculated # of squares near the king that are >controlled by opponent. Bruce writes about dynamic threats >detection, it must be more powerful. I don't know, it's a complicated question. I do know that this mechanism finds some tactics faster when used in my program. If I could do a static king-safety routine of arbitrary complexity in one clock-tick, I think it would make sense to make it pretty complex. It's pretty hard to do a good one given normal CPU constraints though. bruce
This page took 0.01 seconds to execute
Last modified: Thu, 07 Jul 11 08:48:38 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.