So some key parameters related to the problem of solving chess are:
1) Number of nodes in the game tree that need to be examined to solve chess: Unknown.
2) Number of mathematical operations required to solve chess: Unknown.
3) Computer performance achieved by humans: known - at least 500 Teraflops (example: SETI)
4) Size of computer algorithms manageable by humans: known - at least 100 million lines of code (example: 5ESS switching system).
So in my view, the big unknowns related to solving chess are (1) and (2) and not (3), and (4).
Here's my take on the current status and key points of solving chess:
First, contrary to what is sometimes implied, it is not necessary to store the entire game tree, nor the total catalog of all chess positions to solve chess. If chess is a forced win for White, it is necessary to show how White will move for any move by Black. Vice-versa if chess is a forced win for Black. If both sides can force a draw, then it is necessary to show the move to be played by each side to avoid losing, for any move by the opponent.
Such a "perfect game" will reside within the small dark green area of this diagram (other areas can be ignored for the purpose of solving chess).