3 ms·
> * solving Go (hard) 1. Perfect play from any game position. 2. Proof of perfect play. #1 may be achievable with a sufficiently clever algorithm. (We may su
by emptybits 10y ago
> * solving Go (hard)
1. Perfect play from any game position.
2. Proof of perfect play.
#1 may be achievable with a sufficiently clever algorithm. (We may suspect it is perfect and may only later prove it.) #2 may be much much harder. Neither are suitable for brute force approaches to play or proof as some problem spaces are.