Grandmaster-Level Chess Without Search

Re:Grandmaster-Level Chess Without Search by joe_the_user on Thursday February 08, 2024 @04:55PM (#39308289)

Is the model more efficient than Stockfish? I think Stockfish runs on regular CPU computer and I'd guess this " 270M parameter transformer model" requires a GPU but I can't find any reference to efficiency in the paper.

Also found in the paper: "While our largest model achieves very good performance, it does not completely close the gap to Stockfish 16". It's actually inferior but they still think it's an interesting exercise. But that's the thing, it's primarily an exercise like calculating pi to a billion decimal points or overclocking a gaming laptop.

[ Parent | on HN ]

Re:Grandmaster-Level Chess Without Search by janalsncm on Thursday February 08, 2024 @06:13PM (#39309099)

Well I think it’s interesting to the extent that it optimizes the solution for a different piece of hardware, the TPU. Their results are also applicable to GPUs. Since the problem is highly parallelizable, we might expect a viable model to quickly approximate a more accurate evaluation, and perhaps even make up for it in volume.

[ Parent | on HN ]

Re:Grandmaster-Level Chess Without Search by rolisz on Friday February 09, 2024 @02:20AM (#39312313)

BERT has around that many parameters and it runs on CPU in 200ms

[ Parent | on HN ]

Re:Grandmaster-Level Chess Without Search by spookie on Friday February 09, 2024 @03:29AM (#39312690)

In that time Stockfish 16 would evaluate about 2 million positions on a mildly powerful consumer CPU

[ Parent | on HN ]

Re:Grandmaster-Level Chess Without Search by samus on Friday February 09, 2024 @08:03AM (#39314401)

270M are very tractable even on CPUs.

[ Parent | on HN ]