Of course, since we are using computers, it may be easier to define it in a language more suited to computer (programming, at its heart is mathematics). In pseudo code, what does it mean to be solved, exactly?
I don't have pseudo code to define a solved game, but a solved game can best be described by just saying you know the outcome if both players played perfectly. For example, Tic-tac-toe is solved, because we know that with perfect play, neither side can win.
This is a good video: (Infinite chess - YouTube) that talks about solving chess. At about 1:30 a game tree is created for the game of Nim. In this example one player can force a win (but there are other versions).
The video later talks about "infinite chess". Evidently some people think chess is not complicated enough, so they are now studying games on an infinite board.
FLOPS is a way to see how computers have improved, but it's not used to measure chess positions. Checkers and chess are analyzed with integer-like operations (floating point numbers with exponents not needed).
Checkers was solved using about 2000 GFLOPS (2 TFLOPS). Today some supercomputers operate at 50,000 TFLOPS (50 PetaFLOPS). So we have about 25,000 times the processing power that was used for checkers. You can "take-away" a few orders of magnitude of calculations I showed previously, and it's still easy to see a path to chess being solved. The answer to this thread's question is probably Yes.
No, FLOPS is a measurement, floating point operations per second...no more, no less. I am aware of "integer-like operations". You might want to spout your vague "Google is my co-pilot" BS at somebody who didn't work in Silicon Valley managing development teams and departments for 15+ years. Every time I post real numbers arrived at step by step, you post vague estimates and feelings
...