I’ll survey the classical Ehrenfeucht-Fraisse and Ajtai-Fagin games for this Logic. I’ll explain the role of the probabilistic method to prove that s,t-connexity is not Σ11 (EMSO) on graphs, using the Ajtai-Fagin games.