Author: Gian-Carlo Pascutto
Date: 02:17:08 08/19/03
Go up one level in this thread
On August 19, 2003 at 05:04:58, Omid David Tabibi wrote: >[D]3r2k1/pp1r1qpp/2pb4/5p2/3R1P2/8/PPPR2PP/3Q2K1 w - - 0 1 > >My engine has information about all attacked squares, e.g., it knows that d6 >is attacked by a white rook and defended by a black rook. However, I assume >that an SEE should be able to find out that Rxd6 is a winning capture. This >needs a more extensive processing of backed-up attacks (e.g., Rd4 is backed up >by Rd2 which is backed up by Qd1, and Rd7 is backed up by Rd8). I'm afraid >this is too costly a process. Hardly. You can look for the additional attackers after each capture you try, in an incremental way. And given that there's not many directions they can come from, this is fast... -- GCP
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.