Author: Rafael Andrist
Date: 11:07:45 06/22/01
Yes, I know that it would be possible to simply solve this using an endgame database. But that isn't interesting and it would be very slow during search, if I want to evaluate it correctly in a position far away from the root. [D]8/8/8/8/P2P/8/8/8 b - - 0 0 in this position, the "square of the pawns" doesn't reach the top of the board, so they can only win if they're supported by the king. Now my question is, can this condition simply expressed in an inequation or something else? Can I simply compare distances between the two kings in relation to the pawns or is it more complicated? Thanks Rafael B. Andrist
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.