Single Comment

When Chess V evaluates positions that are materially equal, how does it
choose between them?  That's more than just a rhetorical question.  We
know there are bound to be thousands of positions that are strategically
and tactically a dead draw.  Whatever distinctions can be found, they
must
be very subtle.  For instance, at the start of the game, what makes 1.
Pa2-a6 any better than 1. Pa2-a3?  Does Chess V employ at some point a
random function to choose between the moves available to it?  If Chess V
plays against itself, how does it perform if the only thing different is
the random seed?  Does C as a programming language allow use of different
pseudo-random number generators, or are you stuck with the one that comes
with your C package?  Would two different versions of Chess V perform
differently if the only thing distinguishing them were the random seeds
inside the C source code?

As for numerical values representing the strengths of the pieces, were
the
figures arrived at through empirical analysis, or by guessing?  Empirical
analysis implies that different versions of Chess V performed differently
when pitted against itself, and the data produced was relied on for newer
versions.