[snip]
So far as my use of strong solution of game states is concerned, I have seen it stated that n-man (basic rules) chess is strongly solved by the Nalimov tablebases, which I take to mean each n-man position is strongly solved (under basic rules most people would identify "position" and "game state").
It does, in a very straightforward manner. For each position, if there is a winning move, play one with the lowest moves to mate. Otherwise if there is a drawing move play one. Otherwise any move satisfies the needs of a strong solution.
Of course this is only true for the positions in the tablebase...
I spend probably more time on endgame problems than actually playing chess; they generally assume basic rules and they usually call for the solution (unqualified) of specific positions, by which they mean weak solution of the games starting with the positions, which is a similar use.
Almost. But note that such problems generally don't accept slower solutions, so a weak solution may not suffice.
!) In my opinion, in chess the pieces speak louder than words. If someone says "I resign" when giving checkmate, the checkmate would carry the day, although I think an arbiter would be within his rights to cross examine the perpetrator and if it was deliberate the player could possibly be warned or even subject to sanctions.
My point is the laws don't say that.
They do say:
12.1 The arbiter shall see that the Laws of Chess are observed.
If the laws of chess are observed in that case, both players win.
5.1.1 The game is won by the player who has checkmated his opponent’s king. This immediately ends the game, provided that the move producing the checkmate position was in accordance with Article 3 and Articles 4.2 – 4.7.
5.1.2 The game is won by the player whose opponent declares he resigns. This immediately ends the game.