According to the Wikipedian article, a game is considered weakly solved if an algorithm that secures a win for one player, or a draw for either, against any possible moves by the opponent, from the beginning of the game can be found.

The chess-specific Wikipedia article quotes some rather long timelines citing the daunting combinatorics, and goes on that

Recent scientific advances have not significantly changed these assessments. The game of checkers was (weakly) solved in 2007, but it has roughly the square root of the number of positions in chess. Jonathan Schaeffer, the scientist who led the effort, said a breakthrough such as quantum computing would be needed before solving chess could even be attempted, but he does not rule out the possibility, saying that the one thing he learned from his 16-year effort of solving checkers "is to never underestimate the advances in technology".

Here is the question:

Will chess be weakly solved by 2035?

Chess is considered to having been weakly solved if a researcher makes such a claim and the claim is arguably accepted by academia within a year, in a sense comparable to checkers' solution. Assessment will be made at Jan 1, 2035.