Author: blass uri
Date: 02:10:54 11/04/99
Go up one level in this thread
On November 04, 1999 at 00:22:07, Ratko V Tomic wrote: <snipped> >Any excess piece would only drop the pawn maximum for that >side by 1 My program used this fact and the fact that: an upper bound for the number of promoted white pieces is 2*the number of captures of black pieces+the number of captures of white pieces(I include pawns also as pieces). I proved this upper bound by proving that it is even an upper bound for the number of good pawns+the number of promoted pawns. I proved it by proving that every capture of black piece cannot increase the number of good white pawns and promoted white pawns by more than 2 and cannot increase the number of black good pawns and black promoted pawns by more than 1. I used of course the simmetric case when I replace white by black. Uri
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.