←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.215s | source
Show context
squidgedcricket ◴[18 Oct 24 02:04 UTC] No.41875758[source]▶
Would it be feasible to create a complete lookup table of 'best' moves for all given board configurations? I'm not sure how to determine the total number of configurations. Not the same as a tablebase, just a single next move rather than sequence to checkmate.

It wouldn't be competitive against top tier players and AI, but I wouldn't be surprised if it could beat me. 'Instantly' knowing the next move would be a cool trick.

replies(3): >>41875783 #>>41875833 #>>41876086 #
1. roenxi ◴[18 Oct 24 03:20 UTC] No.41876086[source]▶
That is basically what a neural network based chess engine is. The function the neural network is encoding is logically equivalent to "probability this move is the best for this board state".

The resolution isn't great, and adding search to that can be used to develop an implicit measure of how accurate the function is (ie, probability the move suggested in a position remains unchanged after searching the move tree for better alternatives).