Game solved (After 122 years)

How do you post games like that?

It's such a large number that it has its own name "the Shannon number" and is estimated to be in the general order of roughly (10)^43.

There's a little grey-and-white chessboard symbol in the message reply box. Click that symbol, then follow the directions. You can input a complete game (with comments and variations), or a position or problem. You'll find those options in the "Set-up" tab.

When you write your message hit the little chess board icon.  Then select "Load pgn", paste it, and hit enter. The total pgn for the position above is:

The last line is the one move in this summary, but normally includes more moves or an entire game. I believe the headings are optional, but if not included there will be no information posted about the game. Hope this helps

How do they base a "number of possibilities" figure on the AVERAGE length of a game, rather than on the greatest possible length of the game?

I remember that in chess, 30 captures and 96 pawn moves are possible for both players - for a total of 126 "game changing" events. 

Before the first one and between any two of these (but not after the last one, as only two kings would remain!), 74.5 moves can be played without a draw automatically occurring, if both parties still want to win. 

126*74.5 + 1 (let's say that the very last move is either mate or isn't, in which case we will have a draw) = 9388 moves. 

We shouldn't subtract 25 from this number, saying that at least after the one-before-last game changing event, at least one of the players will want a draw - because maybe that player is confident in his ability to draw anyway and doesn't mind if the game drags on. 

So the longest game possible is 9388 moves (each move is a two-ply).

Now let's say that because many of these positions involve few pieces and few possible moves, that we multiply not by 10^3 per two-ply, but only by 3.1*10^2 per two-ply - which implies a conservative average of about 22 possible moves per position - rather than the more customary 30 or 31. 

So we get 10 ^ (2.5 * 9388) or 10 ^ 23,470 possible chess games, and that's already a correct figure, I suppose. 

Of course, once you get to the endgame, there will be just tons and tons of duplicative positions between these games, as many games will reach the exact same ending - but in different ways, thus still making different games. 

I have a phone and I don't see it

this post was too long so i didnt even read it completely, but i just wanted to post some non-sense.

i think we should start by first asking you why did you use larger font size than the default.

Not true. In fact, many computer scientists and engineers are concerned because processing power increase is starting to slow, which is a sign that Moore's Law is reaching its limits. Whether some new technology will replace digital computers, or complement them, is unknown. 

Computers cant think, and mathematics cant help with philosophy buds, so computers will never solve anything, humans are superior. Lol. 

I think it would be easier to solve chess if we trapped all living GMs in a gulag or something and forced them to analyze chess with help of Stockfish

A good numberphile episode on the number of games of chess. 10 to the 120 is likely a massive underestimation.

It is more likely 10 to the 10 to the 50 meaning 1 followed by 10 to the 50 zeroes,.

Yes, solving chess is the most useful thing those computers can do.

I also like it because it is much more difficult or impossible for people to cheat when playing on-line (until someone makes an engine for the new variant)

Not serious, right? If so will you show the math (or source)?

LOL!!

Don't fall for the "fake" news sites... Pretty soon supercomputers will not only be exponentially more powerful, but will be thousands of times bigger.

And once we solve chess, just for a goof, God is going to say "No, guys, you have the rules wrong.  Black goes first, and queen can only move two, but she gets to jump like a knight."