I'm trying to imagine the finite graph of all positions in chess. Due to the sheer number of possible positions, it is impossible with current technology to build an exhaustive database. Such a database would require more than 100 zetabytes of storage.
But even if we can't store the positions exhaustively, would it be possible to count winning lines for each side? That is, can the number of arrows going to Draw, to Black Won, and to White Won be determined mathematically? And if so, would White have more winning arrows than Black?