@12474
"under basic rules"
++ Without competition rules chess is not solvable.
1 Nf3 Nf6 2 Ng1 Ng8 3 Nf3 Nf6 4 Ng1 Ng8 etc.
I have explained an mathematically entirely adequate resolution of this for basic chess rules - i.e. the only draws are stalemate and agreement.
The resolution permits infinite games and defines the value of an infinite game to be a draw. While this might appear to make the game more complex in some sense, it does not make the solution more complex.
If you hypothetically construct a tablebase, what you find are the positions that are wins for one side. This leaves a set of positions where (according to the extended rule) optimal play will lead to an infinite game (should be fairly obvious) so are draws.
Weak drawing rules would suffice to make games finite without compromising the values of positions. There is some N for which an N-move rule for drawing would suffice. And any repetition rule would also make games finite (less efficiently - games can be very long) without any ugly changes to values.
A 3-fold, or 5-fold, or n-fold repetition rule is necessary to end an infinite sequence.
37 of the 116 perfect games end in 3-fold repetitions, usually some sacrifice to force a perpetual check.
On the contrary the 50-moves rule plays no role: the 116 perfect games end in at least 15, at most 73, average 40, standard deviation 11 moves, long before the 50-moves rule could trigger.
@12474
"under basic rules"
++ Without competition rules chess is not solvable.
1 Nf3 Nf6 2 Ng1 Ng8 3 Nf3 Nf6 4 Ng1 Ng8 etc.
A 3-fold, or 5-fold, or n-fold repetition rule is necessary to end an infinite sequence.
37 of the 116 perfect games end in 3-fold repetitions, usually some sacrifice to force a perpetual check.
On the contrary the 50-moves rule plays no role: the 116 perfect games end in at least 15, at most 73, average 40, standard deviation 11 moves, long before the 50-moves rule could trigger.