Obvious answer is you're not miles and miles cleverer than @btickler. It's obvious from your posts that you haven't got the slightest grasp of the subject.
Chess will never be solved, here's why

Well, I just took a look. I looked at two of your posts and in each one, you were abusing a different person. Neither was me because you've blocked me. Incidentally, how can it be the best thread on the subject and I'm miles and miles cleverer than you but I'm blocked from it? Just wondering.
Your assessment of yourself is (notably, and not just by one person) off. That's not the reason why, though. You are blocked from my threads because of the Covid thread block. If I could block only for a single thread, I would do so. Consequences.
If it's the man on the other end of @tygxc's big red telephone, you need to take everything with a pinch of salt.

If Computers can solve English Checkers, then they can eventually solve Chess, too.
If not so, prove it.

"There are 9,132,484 distinct positions or 120,921,506 total positions after 6 moves (three moves for White and three moves for Black)."
Wow, Awesome! Not so, unsolvable whatsoever.

"There are 9,132,484 distinct positions or 120,921,506 total positions after 6 moves (three moves for White and three moves for Black)."
Wow, Awesome! Not so, unsolvable whatsoever.
No replies?
Then I see, The King 👑 hath Spoken once More.

"There are 9,132,484 distinct positions or 120,921,506 total positions after 6 moves (three moves for White and three moves for Black)."
Wow, Awesome! Not so, unsolvable whatsoever.
No replies?
Then I see, The King 👑 hath Spoken once More.
I believe you fundamentally misunderstood the quote you posted, so let me post it in its entirely along with the link.
"The number of distinct chess positions after White’s first move is 20 (16 pawn moves and 4 knight moves). There are 400 distinct chess positions after two moves (first move for White, followed by first move for Black). There are 5,362 distinct chess positions or 8,902 total positions after three moves (White’s second move). There are 71,852 distinct chess positions or 197,742 total positions after four moves (two moves for White and two moves for Black). There are 809,896 distinct positions or 4, 897,256 total positions after 5 moves. There are 9,132,484 distinct positions or 120,921,506 total positions after 6 moves (three moves for White and three moves for Black). The total number of chess positions after 7 moves is 3,284,294,545. The total number of chess positions is about 2x10 to the 46 power. If you understand this and like math tell us the answer." - Reed Richards, 2010, https://www.chess.com/forum/view/general/i-need-a-math-genius-to-explain-how-many-chess-positions-there-are
Whats important here is the part you selected, "There are 9,132,484 distinct positions or 120,921,506 total positions after 6 moves (three moves for White and three moves for Black)." Its not that there are 120,921,506 total positions LEFT after 6 moves, it is that there are 120,921,506 positions GIVEN after 6 moves. I just spent my entire time typing this and Chess.com flagged it for no reason but to cut a long story short: Based on the information from the guy you used there are at LEAST 10^47 games. Given this and given the current maximum capabilities of super computers (which can hold 10^17 bytes) it can be seen that the MINIMUM amount of possible games is 10^29 times greater than the amount of information we can currently store.
It is important to remember that this is a small bound, 10^47, the person that INVENTED computers the real KING 👑 worked this out long before us. His name was Claude Shannon and he proved that there were more chess positions than number of atoms in the universe. While this number is bigger than 10^47 is it probably closer to the number of actual significant games than the person who made that Chess.com post. Using this, if we were to use the number of atoms in the universe as bits to store our Chess game (literally a 1:1 correspondence which would not be possible) we would still run out of space to store all of the possible games. This problem would not exist for a quantum computer, however none of our quantum computers are that capable yet so as of RIGHT NOW, the problem of solving chess IS UNSOLVABLE.
TLDR: You literally as of today CAN NOT solve chess using a computer/supercomputer there is not enough storage in the world to hold the games. In the future, this still may be the case. A Quantum Computer with enough capability (which is feasible unlike the storage problem) could solve chess

Incidentally, everyone who has an understanding of how machine learning, reinforcement learning and AlphaZero work also knows that the "knowledge" acquired by AlphaZero and referred to in the paper title is inductive in origin and uncertain in character. Indeed, it is explicitly uncertain, in that AlphaZero expresses its knowledge about positions in the form of an array of probabilities.
Probabilities are not "explicitly uncertain", you can and usually do chose the move with the highest expectation value, in an absolutely deterministic manner. There isn't anything random or undeterministic here (unless it's added by hand, e.g., to randomly choose one among equivalent (?) opening moves.)
btickler, you regularly warn and report people who advertise their blogs and clubs in threads that are not even your own, yet here you are doing exactly the same thing. Spamming. How unlike you!
It's directly related, and was posted in context, given that somebody was wondering if this solving chess thread is a worthwhile read.
You're not that good at turning things around on people. You'll need to seek vengeance elsewhere.