If chess is deterministic, can we prove that from a set of infinitely large number of games, that white always wins/doesn't win?

80 Views Asked by At

In some lesser complex games such as Tic-tac-toe or connect4, the first person can force a win/draw. Can we prove the same in a much more complex game like chess, where white can force a win/draw?.