Here's how Alice, who doesn't even know the rules to chess, can defeat a grandmaster. (This is sometimes called the Chess Grandmaster Problem.) She challenges both Gary Kasparov and Anatoly Karpov to a game, at the same time and place, but in separate rooms. She plays white against Kasparov and black against Karpov. Neither grandmaster knows about the other. Karpov, as white, makes his first move. Alice records the move and walks into the room with Kasparov. Playing white, she makes the same move against Kasparov. Kasparov makes his first move as black. Alice records the move, walks into the room with Karpov, and makes the same move. This continues, until she wins one game and loses the other, or both games end in a draw.
—from Applied Cryptography, a book by Bruce Schneier
Active since October 3, 2018.
731 total characters in this text.
View Pit Stop page for this text
| Universe | Races | Average WPM | First Race |
|---|---|---|---|
| Default (English) | 2,375 | 96.61 | October 3, 2018 |
| Instant Death Mode | 2 | 149.35 | May 11, 2020 |
| α Stenography | 1 | 95.85 | March 28, 2022 |
| All TypeRacer Texts | 1 | 71.88 | November 20, 2021 |
| Home of 2018's New Texts | 1 | 123.50 | September 27, 2018 |