“ Perfect Checkers: A team of Canadian computer science researchers proved that a game of checkers, if played perfectly, will end in a draw—no matter what. This proof is the culmination of 18 years of research and represents “the most complicated game ever ‘solved’.
