@Abigail-III said in #40:
> That is not true. HeX is a solved game for any N x N sized board: it's a win for the first player with perfect play. And the proof is easy: no game can end in a draw, and with a strategy stealing argument you can show that if there's a winning strategy for the second player, there is one for the first.
>
> But for large enough N, we don't know the strategy.
>
> If you have a way to force a win, then the game is solved. But a game can be solved without having a way to a win.
You are right. I was referring to a strong or a weak solution. A game can also be solved without a strategy being found. This is known as an ultra-weak solution. I stand corrected.
If I can prove that as on date, neither white nor black can not force a win or draw from the initial position even when the game is played by the best chess engine, it is sufficient to prove that chess is not solved. Though white has a first-move advantage, chess engines have not been able to use it to force a win or a draw with white.
> That is not true. HeX is a solved game for any N x N sized board: it's a win for the first player with perfect play. And the proof is easy: no game can end in a draw, and with a strategy stealing argument you can show that if there's a winning strategy for the second player, there is one for the first.
>
> But for large enough N, we don't know the strategy.
>
> If you have a way to force a win, then the game is solved. But a game can be solved without having a way to a win.
You are right. I was referring to a strong or a weak solution. A game can also be solved without a strategy being found. This is known as an ultra-weak solution. I stand corrected.
If I can prove that as on date, neither white nor black can not force a win or draw from the initial position even when the game is played by the best chess engine, it is sufficient to prove that chess is not solved. Though white has a first-move advantage, chess engines have not been able to use it to force a win or a draw with white.