Author: Tony Werten
Date: 06:47:42 09/18/03
Go up one level in this thread
[D] rnb1kbnr/ppp1pppp/8/3q4/8/2N5/PPPP1PPP/R1BQKBNR b KQkq - 1 3 A program is playing Black with the above root position as position "P". The first move on the list, M1, is a6. The search tries this and gets a poor score and a causal data structure. The program applies the next move M2 on the list, a5, to the data structure and sees that the constraints that produced the bad score for M1 also produce a simisar score for M2, so M2 is not searched. Some of the constraints in this case: 1. The wN/c3 remains there, unpinned, and able to capture bQ/d5 2. The bQ/d5 remains there and is undefended 3. Black has no known counterattacks or other resources within the depth of the subtree search.
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.