Re:Could a modern chess engine on a Pentium have defeated Ka...
by skew-aberration on Tuesday November 03, 2026 @08:46AM
(#50351924)
On the other hand, symbolic reasoning easily gets superhuman results in narrow domains. The Robbins Conjecture was proved on hardware like that after 60 years. You could check out this theorem prover benchmark suite that has been maintained for over 30 years https://www.tptp.org/
[ Parent
| on HN ]
There are no comments on this comment yet.