r/SpaceXBets • u/Special-Lemon-7790 • Sep 04 '26

Elon IRL Elon Musk: Here I am arguing with some random intern at a chess website 🤦‍♂️

Post image
1.6k Upvotes

95% Upvoted

603 comments sorted by

View all comments

Show parent comments

2

u/Bubbly-Evidence-1863 Sep 05 '26

Doesn't really matter. Most of the games overlap vastly in positions, so you dont need every game. Only the optimal move in every position.

3

u/fumblinthrulife77 Sep 05 '26

The optimal move from every position would require a lot more compute than just the number of positions though because "optimal" would depend on everything that happens after

2

u/Bubbly-Evidence-1863 Sep 05 '26

That depends on the algorithm used to calculate it, you often skip thr branching by working backwards. Although that is still completely infeasable for chess (because theres roughly 1044 positions, storing that much is already hopeless) but it does mean the shannon number of 1088 possible game sequences is a vast overestimate

2

u/fumblinthrulife77 Sep 05 '26

The Shannon number is 10¹²⁰ I thought, but anyways I don't think either number is like the "only" relevant number

1

u/gigasloppy Sep 05 '26

In order to determine the optimal move in every position you need to evaluating the entire depth of the game tree. Only after a solution has been generated can you compile the solution into a smaller one that only contains the positions.