Estimated # of unique chess games
So you're telling me that games of chess are more unique than the infinite universe?
No wonder the game has enduring appeal.
I just came across something interesting in one of my chess books. The estimated total number of possible unique chess games is 10 to the 120th power: 1, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000. In English, that is a thousand trillion trillion trillion trillion trillion trillion trillion trillion trillion trillion.
For your information, physicists estimate the total number of electrons in the universe is "only" 10 to the 79th power.
What do you mean "the universe" ? The Universe is endless, so I guess the number
of electrons is also endless.
I just came across something interesting in one of my chess books. The estimated total number of possible unique chess games is 10 to the 120th power: 1, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000. In English, that is a thousand trillion trillion trillion trillion trillion trillion trillion trillion trillion trillion.
For your information, physicists estimate the total number of electrons in the universe is "only" 10 to the 79th power.
That number is only a lower bound on the number of positions possible. The real total is likely much higher.
If 10 billion people each played a game every second, it would take them more than 10^102 years to play that many games. So, uh, no.
Vance917 wrote: So between igoogoo and igoogoo plex? Now imagine this. A computer that plays against itself repeatedly, essentially forever, but learning as it goes. Initially it simply randomizes for each move (clearly, there are better starting strategies, but let's go with this one). It keeps track of wins and losses, not only overall, but also as a function of which moves were made. Then it modifies the probabilities of future moves so as to be proportional to the empirical probability of winning when that move is played. Would it converge? That is, ultimately, would all probabilities converge to zero or one? Is this the same question as asking if there is a winning strategy?
It will converge, but most likely not to a strategy where the probabilities are zero or one. At each position, it will converge to a probability distribution over the set of optimal moves. If there are more than one optimal move from a given position, then it will most likely assign positive probability to all of them.
I just came across something interesting in one of my chess books. The estimated total number of possible unique chess games is 10 to the 120th power: 1, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000, 000. In English, that is a thousand trillion trillion trillion trillion trillion trillion trillion trillion trillion trillion.
For your information, physicists estimate the total number of electrons in the universe is "only" 10 to the 79th power.