←back to thread

Grandmaster-level chess without search

(github.com)
166 points lawrenceyan | 3 comments | 17 Oct 24 19:13 UTC | HN request time: 0.205s | 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. k2xl ◴[18 Oct 24 02:08 UTC] No.41875783[source]▶
The amount of data that would be required for a lookup table for all best moves for every board configuration would be infeasible.

They have managed to create one for 7 pieces. Last update on trying to get to 8 piece database: https://www.chess.com/blog/Rocky64/eight-piece-tablebases-a-...

replies(2): >>41875862 #>>41876145 #
2. squidgedcricket ◴[18 Oct 24 02:27 UTC] No.41875862[source]▶
Yup, and it looks like a complete tablebase from the start of the game won't ever be feasible.

> From May to August 2018 Bojun Guo generated 7-piece tables. The 7-piece tablebase contains 423,836,835,667,331 unique legal positions in about 18 Terabytes.

3. andrelaszlo ◴[18 Oct 24 03:41 UTC] No.41876145[source]▶
Almost halfway there ;)