Author: KarinsDad
Date: 12:50:08 07/12/99
Go up one level in this thread
On July 12, 1999 at 15:04:02, blass uri wrote: [snip] >> >> >>i=0; >>if (x2>2) i=i+x2-2; >>if (x3>2) i=i+x3-2; >>if (x4>2) i=i+x4-2; >>if (x5>1) i=i+x5-1; >> >>i is a lower bound for the number of promoted white pawns. >>j is a lower bound for the number of promoted black pawns by the same idea. >> >>if ((i<=2*(15-y1-y2-y3-y4-y5)+(15-x1-x2-x3-x4-x5))&& >>(j<=2*(15-x1-x2-x3-x4-x5)+(15-y1-y2-y3-y4-y5))) >> >>is the condition I proved about the number of promoted pawns by my post of bad >>and good pawns. > >It is clear to me that the bound can be improved. >For example I did not use the fact that if the number of pieces is 32 then all >the pawns are bad pawns. > >If we count the number of pawn structure that white has x10 white bad pawns >and x11 white good pawns and black has y10 black bad pawns and y11 black good >pawns then we can use this information to find a better bound. > >The idea is for every x10,x11,y10,y11 to count the number of possible pawn >structures and use i+x11,j+y11 instead of i,j because the condition that >I posted is right for good and promoted pawns and not only for promoted pawns > >The only problem is to count the number of pawn structure whwn we know the >number of bad and good pawns for each side. > >I think that if there is not a simple formula for it(I do not see a simple >formula) then a program can count it. > >Uri Uri, I have looked at what you wrote and your equations. I even tried several promotion examples for your conditional equation. I sort of understand that the conditional equation works (and always will for all cases), however, I still do not understand good/bad pawns. Could you please rephrase it? It could just be a language thing (either that or I am just being dense). Please be specific (i.e. verbose) since the previous explanation was not enough. Thanks, KarinsDad :)
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.