That would actually be really interesting, but would require a super computer due to millions of games per day
Can anyone find out...
20,000,000 games per day
Chess.com has been going for 20 years- about 7000 days
So that's 140 billion games
Each game has about 100 positions
So a rough estimate is 1.4 x 10^13 positions, not all unique.
That's a tiny fraction of the number of possible positions.
An algorithm to check each position against all the other positions and determine how many were unique would be fairly simple to write but would need access to all the data and a fast computer.
I have this random chess fun fact which is "There are more possible games of chess than there are atoms in the observable universe. The approximate number of unique 40-move games is about 10^{120}, while the number of electrons in the universe is approximately \(10^{79}\)." so that's for the possible chess moves.
As a follow up to the question of how many unique positions are possible in traditional chess, can anyone formulate an algorithm to determine how many unique positions have been reached in Chess.Com games, and then how many are left??