10^120 possible games including all legal paths ...
Can you stop quoting that please?
It's Shannon's approximation of the number of 40 move games with an average of 30 moves per ply, Nothing at all to do with the number of legal games.
It's misinterpreted all over the internet (and obvious b*llocks).
Bad enough with @tygxc trying to swamp the internet with the fact that there are 10^2 legal chess positions.
#2268
Here is again the shortest proof game for the first legal Tromp sample.
Its accuracy is near 0%. You can add some moves and/or change the move order, but that changes nothing: the accuracy stays near 0%.
As for the other position it is obvious that white must promote his pawn: preferably to a queen, or else to a bishop, or to a rook, or to a knight. What does that prove? Of course promotion to a queen is the move.
Congratulations. I accept your premise that this position is not the solution to chess . Only 10^44.5 more positions to go...
No it's not 10^44.5, in the game that @tygxc is now proposing to solve, if you don't have a procedure for solving that eliminates the problem of repetitions. (His game includes the 3-fold repetition rule.)
Each way of reaching a position gives you a different set of positions with the same material that, if you're to mate, you must thread a way through to avoid a draw by repetition. Different mates for different ways of reaching the position. Some ways eliminate the mate altogether.
The correct description of a position is a PGN, not a FEN. Even the PGN is slightly deficient, but, apart from the slight deficiency, a PGN from the last ply count 0 position is sufficient.
With @tygxc's currently defined game and procedure the number is HUGELY greater than 10^44.5.
That's one of the reasons the Syzygy tablebases provide only a weak solution of chess under competition rules. You can't start playing an endgame and expect Syzygy to bail you out if you get into difficulties and haven't followed his advice from ply count 0.
If it weren't for the fact that @tygxc has dropped the idea of including the 50 move rule, the number would be a hundred times HUGELY greater than 10^44.5. Winning positions with a ply count of 99 under the 50 move rule are actually very rare (but get less rare for positions with the same diagrams but smaller ply counts).
Tromp's figures apply to the basic rules game ONLY.
@Elroch
The same would seem to apply to the "competition rules" version of checkers, which is another reason that makes me uncomfortable about the reported solution, in the absence of further info, given that Chinook seems designed to play the "competition rules" version.
The numbers describing the state space don't seem to be correct for a forward search - but I still have to work out whether the Kishimoto - Müller algorithm in Chinook completely solves the problem. A description of that, at least, is available.