Chess, Go, and gomoku are proven to have unbeatable strat... | funfact.wiki | funfact.wiki
Chess, Go, and gomoku are proven to have unbeatable strategies (Zermelo's theorem). The theorem proves they exist—not what they are. In gomoku, the winning strategy is known, so tournaments use modified rules.
In the 1982 SAT, only 3 of 300,000 students answered a circle rotation problem correctly. Even the test makers were wrong, and the correct answer was not among the choices. The key is the coin rotation paradox: a circle rolling around an equal circle makes 2 full turns, not 1.
The gameDoom is the quintessential example of software porting. Porting Doom to seemingly impossible devices — pianos, notepads, microwaves — has become a programming tradition, and someone has even ported Doom to run inside Doom itself.