#6901
Take a look at the sample positions from John Tromp: at first glance it is clear that none of these results from a real game, i.e. none has any relevance. In a real game underpromotions to knight, rook, or even bishop do happen occasionally, but are very rare. In no real game anybody will underpromote to a 3rd rook or a 3rd bishop or a 3rd knight. Promotion to a second queen does happen rarely, but 3 or more queens per side are fantasy.
Hence to solve chess only sensible and legal positions need consideration.
Legal means: possible to reach from the initial position.
As sensible I propose: possible with one chess set of 32 pieces and an additional spare queen of each color.
Now not all possible, sensible, legal positions need to be visited to solve chess.
Of the 5 x 10^20 possible positions, Schaeffer needed to evaluate only 10^14 to prove that checkers, played perfectly, results in a draw.
#6899
This includes a vast majority of non sensible positions with more than 2 queens, rooks, bishops, or knights per side. The number of sensible positions with maximum 2 queens, rooks, bishops, knights per side is estimated at a factor of 1 million less.
There's no "sensibility" determination involved in solving chess. But even if there were, and even if your million factor were to be true, 10^38.7 is still unreachable by any reasonably foreseeable technology. You posited that chess could be solved by burning the candle at both ends because we could drop the number of positions to 10^20, which is why you'll take anything you can grasp...but even allowing for 10^38.7, you've got 1,000,000,000,000,000,000 times more positions to go.