Perfect Chess mirrors the Omnium Multiverse

[El_Presidente]

Originally Posted by chen2739

So let me get to the point. Chess has a finite number of pieces, with a finite number of squares, and a finite number of rules. Chess is also a game that has a finite number of moves, and only three endgame possibilities: Win, Lose, draw.

Thus,,,,, Chess is FINITE. In that sense, every game that COULD ever be played, every combination of moves, every permutation and every possible choice and action at every step along the way is simply another BRANCH to take. Some branches branch out more than others, some branches are long than others, but eventually when one finishes out all the branches you arrive at the leaf of win, lose or draw.

It is akin to the multiverse omninum existence that we live in, each and every possible different action at every singular distinct point in conciousness-space-time branches off into a different universe, a different dimension and a different existence. Our 'universe' is simply the one of the many that just so happened to go down *this* path in the space-time contiunumm timeline....

So with a perfect Chess program, with a perfect hardware (preferably quantum computer) we can 'map' out every chess game that has ever been played and that will EVER be played!!!!! There is no 'guessing' and no 'room for error'. The past, present, and future is all ONE!
So essentially even before the game ever started, before White's first move, the battle is already won or lost! It is a superposition of all things possible without having to do anything at all!

I don't see why not a chess program like this cannot be made.
There are only so many combinations and only so many possible ways to play the game. If we can map out every one of them, then there will be no winners and never any losers!

It looks like much of your idea here is related to the notion that chess is finite. Which, for any intents and purposes in our physical universe, is not entirely accurate. I read recently that the combinatorics of each possible chess move makes the game possibilities exponentially increase astronomically. In fact, there are more possible chess games, due to these combinatorics, than there are particles in the universe. This implies that even a supercomputer with absolute efficiency, that is the size of the known universe cannot hold every possible game. In a purely mathematical sense, you could say that chess is finite, but the mathematics show that chess is infinite when compared to our limited universe.

[Then again, this has been brought up already in this thread]

[CraigD]

Originally Posted by El_Presidente

In fact, there are more possible chess games, due to these combinatorics, than there are particles in the universe. This implies that even a supercomputer with absolute efficiency, that is the size of the known universe cannot hold every possible game. In a purely mathematical sense, you could say that chess is finite, but the mathematics show that chess is infinite when compared to our limited universe.

I think this is a pretty good assessment of the practical computability, using a von Neuman machine, of every game of Chess. There are estimated to be about protons, neutrons, and electrons in the visible universe, and, as I note in post #7, about games of chess.

Another relevant figure is the age of the universe in Planck time units: about , which places a limit on the number of states that can have been reviewed by a single entity, which is likewise vastly less than the size of chess.

Note, though, that in the original post

Originally Posted by chen2739

So with a perfect Chess program, with a perfect hardware (preferably quantum computer) we can 'map' out every chess game that has ever been played and that will EVER be played!!!!!

makes reference to a “preferable” quantum computer. The usual approaches to calculating computability and number of states isn’t very applicable to quantum computers, which in a sense may be considered to be infinitely large. There is, however, much well-informed skepticism that large quantum computers are possible using any presently imagined approaches.