13 citations · 13 across the 2 of their papers we have counts for
3 papers
cs.CC2016
On the Complexity of Connection Games
Édouard Bonnet, Florian Jamain, Abdallah Saffidine
In this paper, we study three connection games among the most widely played: Havannah, Twixt, and Slither. We show that determining the outcome of an arbitrary input position is PS…
cs.GT2013★ 13 cited
Monte Carlo *-Minimax Search
Marc Lanctot, Abdallah Saffidine, Joel Veness +2
This paper introduces Monte Carlo *-Minimax Search (MCMS), a Monte Carlo search algorithm for turned-based, stochastic, two-player, zero-sum games of perfect information. The algor…
cs.AI2012
Minimal Proof Search for Modal Logic K Model Checking
Abdallah Saffidine
Most modal logics such as S5, LTL, or ATL are extensions of Modal Logic K. While the model checking problems for LTL and to a lesser extent ATL have been very active research areas…