←back to thread

Grandmaster-level chess without search

(github.com)
166 points lawrenceyan | 1 comments | 17 Oct 24 19:13 UTC | HN request time: 0.201s | source
Show context
joelthelion ◴[17 Oct 24 20:42 UTC] No.41873554[source]▶
I wonder if you could creatively combine this model with search algorithms to advance the state of the art in computer chess? I wouldn't be surprised to see such a bot pop up on tcec in a couple years.
replies(2): >>41873666 #>>41873900 #
alfalfasprout ◴[17 Oct 24 20:52 UTC] No.41873666[source]▶
The thing is classical chess (unlike eg; go) is essentially "solved" when run on computers capable of extreme depth. Modern chess engines play essentially flawlessly.
replies(5): >>41873728 #>>41873731 #>>41873743 #>>41873853 #>>41873911 #
1. janalsncm ◴[17 Oct 24 21:12 UTC] No.41873853[source]▶
Chess is not “solved”. Solved doesn’t mean computers can beat humans, it means for any chess board position we can tell whether white wins, black wins, or the game is drawn with perfect play. We would know if the starting position was drawn, for example.

No computers now or in the foreseeable future will be capable of solving chess. It has an average branching factor over 30 and games can be over 100 moves.