Another constraint is from computational complexity; should we treat things that are not polynomial-time computable as basically unknowable? Humans certainly can’t solve NP-complete problems efficiently.
Generalized chess is EXPTIME-complete and while chess “exact solution” may be unavailable, we are pretty good at constructing chess engines.
Generalized chess is EXPTIME-complete and while chess “exact solution” may be unavailable, we are pretty good at constructing chess engines.