Claims

../

2025_05_06_cambie_provoost: Cambie and Provoost's game solver shows that Bob wins the unbiased clique game on K_n for 3 <= n <= 8 and determines the maximum-degree game on K_n for n <= 8: Alice wins at n = 2, 3 and Bob ties from n = 4 on.

2026_08_05_didin_pimenov: Didin and Pimenov prove by a potential argument that the two-edge player wins the (1:2)-biased clique-building game for every large n, with 3^158 as the threshold of their Lean development; confirmed by Cambie on the thread.

---