2026-09-05 20:26 UTC
To fully solve chess you wouldn’t necessarily have to model every possible game situation; it might also be possible to discover an algorithm that provably can achieve at least a draw no matter what.
Replies (2)
-
@Doomsider@lemmy.world 2026-09-05 22:42
They already have algorithms to do this.
-
@SkunkWorkz@lemmy.world 2026-09-06 08:55
But fully solved in the computer science sense does mean calculating every scenario. The program needs to be able to calculate every possible end game based on the starting position on the board to know the perfect move set, that’s fully solved chess. Anything less than that is not mathematically solved.