@6595
"A hypothetical super power chess computer running at insane speeds might claim, prior to making its first move: Mate in 2,212,598,303,505,004,977"
++ No, that is mathematically impossible. There are only 10^44 legal positions, most of them nonsensical. After a search of width w candidate moves with depth d moves we reach w^d positions, assuming we reduce w to avoid transpositions.
This gives the following maximum depths for various widths:
width depth
2 148
3 93
4 74
5 63
6 57
7 52
8 49
9 46
10 44
11 42
12 41
13 40
14 38
15 37
16 37
17 36
18 35
19 34
20 34
Any checkmate in more than 148 moves must consist of forced moves only and by both sides.
The hypothetical super power chess computer running at insane speeds can only state, prior to making its first move: 'I offer a draw, because it is a draw'.
I mean, you aren't expected to understand anything and our semblance of communication is for form's sake.