As some trolls obscure the discussion with a personal 'definition' and as Wikipedia misquotes the reference it lists itself, here are the official definitions, with references.
Chess is the game as described by the Laws of Chess.
Ultra-weakly solved means that the game-theoretic value of the initial position has been
determined,
weakly solved means that for the initial position a strategy has been determined to achieve the game-theoretic value against any opposition, and
strongly solved is being used for a game for which such a strategy has been determined for all legal positions. Van den Herik, 2002, Games Solved now and in the Future
A strategy can be a set of moves like Checkers, a set of rules like Connect Four, or a combination.
The game-theoretic value of a game is the outcome when all participants play optimally.
Optimal play is play without errors.
An error (?) is a move that turns a draw into a loss, or a win into a draw. (Hübner 1996)
A blunder or double error (??) is a move that turns a win into a loss.
A diagram is the location of all men on the board.
A position is a diagram plus side to move, castling rights, and en passant flag. (Laws of Chess)
A node is a position plus evaluation and history. Nodes per second
@7607
"how many trillions of times faster does a computer need to be to solve chess"
++ Existing computers of 10^9 nodes/s can weakly solve Chess in 5 years exahausting all 10^17 relevant positions.
...a personal opinion that will never bear fruit.