Timeline for Is there a way to figure out what the average number of moves would be if all games were played to completion?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 25, 2022 at 19:12 | comment | added | Darrel Hoffman | You could input all the recorded tournament games, up until one player resigns, and feed that position into Stockfish or whatever and see how many more moves it would've taken to actually mate, then calculate those averages. Not sure what the value of that exercise would be though. Doing every possible game is absurd, because the vast majority of possible games would never happen in reality if both players are actually trying to, you know, win... | |
| May 25, 2022 at 17:45 | comment | added | GOATNine | Seeing as the Shannon number is ~10^40 greater than the number of atoms in the observable universe, I would have to agree that brute force is not even worth a glance for this type of problem. | |
| May 24, 2022 at 21:55 | comment | added | Kevin | Well, in theory you could expand out the entire game tree and exhaustively count up how deep every single branch is, then take some sort of average. But to the best of my understanding, there is no efficient way to do it, and the brute force method is obviously wildly impossible. | |
| May 23, 2022 at 23:05 | history | answered | Brian Towers♦ | CC BY-SA 4.0 |