@Optimissed, here is access to a mathematical representation of all chess positions with 7 or fewer pieces on the board:
No it's not.
These positions, for example, are not represented.
Basic chess positions, as for pretty much all the numbers bandied around. I don't think a single number has been posted even incorporating moves to zero (just multiply the basic numbers by 50 or similar).
And I'll repeat again, basic chess positions are entirely adequate for a weak solution of chess (dealing with a 50 move rule in generating a proof tree is simple). And it is such a weak solution that is the focus of the majority of this discussion - it is the meaning of "solved" that is being addressed.
Your point that strong solution of FIDE rules chess is much more impractical is correct, but not so interesting. There is no strong solution of (basic rules) checkers yet!
FYI optimissed you should realize that the zermelo stuff applies independently of game complexity.
you should also realize that your definition of a 'mathematical representation' is improper, and that's causing your misunderstanding.
you are interpreting 'mathematical representation' as a human-written algorithm to guarantee and verify a solution of the game.
but a game as a mathematical object/representation is just the ruleset of the game expressed in logical language. human abilities and technology have no bearing here.