The game tree for chess is finite, because of the 50-move rules (and similar rules). It's just a matter of FINITE time of checking out each possibility with a min-max algorithm.
The problem is that that finite time could be a quadrillion times the age of the universe.
So can chess be solved? Yes. Can it be solved in a practical amount of time? Probably not.
I stuck mainly to other subjects when I was a wikipedia editor. Math, physics, other sciences, a little sports and various random things. Just a 4-figure number of edits on a 3-figure number of articles.