source

Transcript:
Elon: The actual number of moves that are not utterly stupid in chess is tiny and chess will be fully solved one day

Chess.com: Skill issue

Elon: Chess is hard for humans, but not for computers. One day, it will be fully solved like checkers. Between now and then, or even after, have fun. People enjoy may games/sports where machines are vastly better.

Chess.com: There are more possible chess games, by about 40 order of magnitude, than atoms in the observable universe. To solve chess, you’d have to map them all. Good luck.

Elon: Wrong, all legal chess positions are ~40 ooms less than the estimated atoms in the Universe. And ASI will figure out ways to solve and compress that are far beyond what we could possibly comprehend. (Here I am arguing with some random intern at a chess website)

Chess.com: I’m a full-time employee

Elon: (something-emoji)

Chess.com: Even my friends don’t text me back that fast

    • red_tomato@lemmy.worldEnglish
      14·
      16 days ago

      Like tic-tac-toe, there’s a way to play checkers so that it always forces a win or a draw for you. That’s not possible yet in chess.

    • Captain Aggravated@sh.itjust.worksEnglish
      6·
      16 days ago

      Yeah, every possible combination of checkers moves has been simulated and analyzed. We know everything there is to know about playing checkers, there’s no new strategies to discover. We can write an algorithm that will ALWAYS choose the best possible move.

      You may have independently done that with Tic Tac Toe.

      It’s not possible to do with chess. The number of possible combinations of moves is astronomical; if we used up every atom in the observable universe we couldn’t write them all down, so there might be revolutionary new strategies that remain undiscovered, and that will never not be the case.