Update: TicTacToe2 solution

Author: Vic-Nas

kattis/TicTacToe2/tictactoe2.vn.py

@@ -55,6 +55,6 @@
 
     # wins[X] -> A, wins[O] -> B, grid.count(X)-grid.count(O)==i -> Ci
 
-    # yes = (A.¬B.C1)+(¬A.B.C0)+(¬A.¬B.(C0.C1))
+    # yes = (A.¬B.C1)+(¬A.B.C0)+(¬A.¬B.(C0+C1))
     # Fun fact: We could try to simplify this.
     # We'll probably find a simpler equation for no.