Grandmaster-level chess without search

(github.com)

166 points lawrenceyan | 1 comments | 17 Oct 24 19:13 UTC | HN request time: 0s | 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 #

jeremyjh ◴[18 Oct 24 02:21 UTC] No.41875833[source]▶

>>41875758 #

There are more possible chess games than there are atoms in the universe. It can't be solved by brute force.

replies(1): >>41875944 #

1. squidgedcricket ◴[18 Oct 24 02:49 UTC] No.41875944[source]▶

>>41875833 #

There's a lot of chess configs, but there's a LOT of atoms in the observable universe. I suspect there's a few in the unobservable universe too.

Chess configs = 4.8 x 10^44, Atoms > 10^70

https://tromp.github.io/chess/chess.html https://physics.stackexchange.com/questions/47941/dumbed-dow...

You might be able to pull off a low-resolution lookup table. Take some big but manageable number N (e.g 10^10) and calculate the maximally even distribution of those points over the total space of chessboard configurations. Then make a lookup table for those configs. In play, for configs not in the table, interpolate between nearest points in the table.

↑