In "any position", there is one or more optimal moves which allows the forcing of the optimal result against any counterstrategy. In some positions this is a draw, in some positions a win (and in some a loss, which means all moves are optimal in the pure sense).
I'm not convinced. You're making an assertion that I don't agree with, but you're offering no rationale.
I didn't, but this is a theorem from the theory of finite games, so you can be absolutely sure it is true.
The proof is not trivial but is quite easy.
OK, I'm a bit out "over my skis" here, but what is the definition of a "finite game"?
He's trying to blind us with theory. A finite game is one that is not infinite. Thet is, it ends at some point and does not have an infinity of permutations or positions. Chess might as well be infinite, for all the possibility there is in tracing all the possible games.
LOL. The difference is very important when you want to prove facts rigorously.
<<I didn't, but this is a theorem from the theory of finite games, so you can be absolutely sure it is true.>>
I stopped accepting Elroch's judgement many years ago.
While a reasonable amount of skepticism is always appropriate, with all due humility you would very rarely go wrong by believing what I say. That is because I have not lost a lifetime's habit for being precise and correct.
Your quote above is an example. Anyone who checks the body of knowledge will confirm it, via my link or any other good source.
In "any position", there is one or more optimal moves which allows the forcing of the optimal result against any counterstrategy. In some positions this is a draw, in some positions a win (and in some a loss, which means all moves are optimal in the pure sense).
I'm not convinced. You're making an assertion that I don't agree with, but you're offering no rationale.
I didn't, but this is a theorem from the theory of finite games, so you can be absolutely sure it is true.
The proof is not trivial but is quite easy.
OK, I'm a bit out "over my skis" here, but what is the definition of a "finite game"?
A finite two player game is where there are two players, they move alternately, there are a finite number of alternatives at each move and every game ends in a finite number of moves. An example of a game that fails to meet the definition would be noughts and crosses on an infinite plane. Chess only meets the definition if you assume draws are forced by the 50 move rule or a repetition, rather than needing to be claimed.
[Also, I don't think my adjective "easy" was really appropriate. Rather it is a concise proof!].
What if there were two players and they each had two moves alternately?
I am not sure what you mean. If the rules of a game permit one to go on forever, it is excluded by definition.
If you meant something else, do say.