Re: [math-fun] Chess problem

On 8/23/06, David Wilson <davidwwilson@comcast.net> wrote:

The problem arose in trying to determine whether a two-computer chess program could be played where the computers transmitted one 8-bit byte per move. <snip>

Regarding pending pawn promotions, each promotion counts as a distinct move, so yes, an unblocked seventh-rank pawn with two possible captures yields 12 possible moves.

It's clearly feasible to have three such pawns, which exhausts the byte. -- Mike Stay metaweta@gmail.com http://math.ucr.edu/~mike