This is Alice. She doesn't know how to play chess, but she's studying information security. Therefore, she will be able to beat the grandmaster. To do this, she will need:
Two grandmasters,
Two chess boards with figures
Two rooms.
And here's how she will do it.
The grandmaster problem
Alice invites Garry Kasparov and Anatoly Karpov to play chess with her in the same place, at the same time, but in different rooms. Neither Kasparov nor Karpov are aware of the presence of the other.
.
, . , . .
, , . .
, , . , , .
– . , .
, -, .
. , , . . , . , . . , . , , . .
, , . , , , .
, .
, , , , . . .
,
. . – , – .
. . , . , , . , , . , , .
, , . .
,
, . – , . – -. .
, . . . , , .
, , .
. « » . , – . , , , , , .
– . . , , .
:
t — , , . , ( F — first), (S — second). .
F z = 0.
S t . y = t.
F e. e - z ≠ t, F . e - z = t, S , F . , S . e - z = t, S , . . e - z = t, S , F t . F z = e + t.
S f. f - y ≠ t, S . f - y = t, F , S . , F . f - y = t, F , . . f - y = t, F , S t . S y = f + t.
4, 5 , - , .
– , , . -, – , . , . , !
:
. , 2- : , , // . ., . – 2002. – . 14.