Difference between revisions of "Abdallah Saffidine"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
(3 intermediate revisions by the same user not shown) | |||
Line 39: | Line 39: | ||
* [[Edouard Bonnet|Édouard Bonnet]], [[Abdallah Saffidine]] ('''2014'''). ''On the Complexity of General Game Playing''. [[ECAI CGW 2014]] | * [[Edouard Bonnet|Édouard Bonnet]], [[Abdallah Saffidine]] ('''2014'''). ''On the Complexity of General Game Playing''. [[ECAI CGW 2014]] | ||
==2015 ...== | ==2015 ...== | ||
+ | * [[Marie-Liesse Cauwet]], [[Olivier Teytaud]], [[Hua-Min Liang]], [[Shi-Jim Yen]], [[Hung-Hsuan Lin]], [[I-Chen Wu]], [[Tristan Cazenave]], [[Abdallah Saffidine]] ('''2015'''). ''Depth, balancing, and limits of the Elo model''. [[IEEE#CIG|IEEE Conference on Computational Intelligence and Games]] 2015, [https://arxiv.org/abs/1511.02006 arXiv:1511.02006] | ||
* [[Olivier Teytaud]], [[Abdallah Saffidine]], [[Shi-Jim Yen]] ('''2015'''). ''The complexities of Go''. [[Advances in Computer Games 14]] | * [[Olivier Teytaud]], [[Abdallah Saffidine]], [[Shi-Jim Yen]] ('''2015'''). ''The complexities of Go''. [[Advances in Computer Games 14]] | ||
* [[Edouard Bonnet|Édouard Bonnet]], [[Florian Jamain]], [[Abdallah Saffidine]] ('''2015'''). ''[https://link.springer.com/chapter/10.1007/978-3-319-27992-3_15 Draws, Zugzwangs, and PSPACE-Completeness in the Slither Connection Game]''. [[Advances in Computer Games 14]] | * [[Edouard Bonnet|Édouard Bonnet]], [[Florian Jamain]], [[Abdallah Saffidine]] ('''2015'''). ''[https://link.springer.com/chapter/10.1007/978-3-319-27992-3_15 Draws, Zugzwangs, and PSPACE-Completeness in the Slither Connection Game]''. [[Advances in Computer Games 14]] | ||
* [[Edouard Bonnet|Édouard Bonnet]], [[Florian Jamain]], [[Abdallah Saffidine]] ('''2016'''). ''On the Complexity of Connection Games''. [https://arxiv.org/abs/1605.04715 arXiv:1605.04715] | * [[Edouard Bonnet|Édouard Bonnet]], [[Florian Jamain]], [[Abdallah Saffidine]] ('''2016'''). ''On the Complexity of Connection Games''. [https://arxiv.org/abs/1605.04715 arXiv:1605.04715] | ||
+ | * [[Tristan Cazenave]], [[Abdallah Saffidine]], [[Michael Schofield]], [[Michael Thielscher]] ('''2016'''). ''Nested Monte Carlo Search for Two-Player Games''. [[Conferences#AAAI-2016|AAAI 2016]], [https://www.aaai.org/ocs/index.php/AAAI/AAAI16/paper/view/12134/11652 pdf] | ||
+ | * [[Tristan Cazenave]], [[Abdallah Saffidine]], [[Nathan Sturtevant]] ('''2019'''). ''Computer Games Workshop at IJCAI 2018''. [[ICGA Journal#41_2|ICGA Journal, Vol. 41, No. 2]] | ||
+ | ==2020 ...== | ||
+ | * [[Tristan Cazenave]], [[Jaap van den Herik]], [[Abdallah Saffidine]], [[I-Chen Wu]] ('''2020'''). ''The ACG 2019 Conference''. [[ICGA Journal#42_4|ICGA Journal, Vol. 42, No. 4]] » [[Advances in Computer Games 16]] | ||
=External Links= | =External Links= |
Latest revision as of 12:57, 16 January 2021
Home * People * Abdallah Saffidine
Abdallah Saffidine,
a French computer scientist and games researcher, currently at University of New South Wales.
He hold a Ph.D. from Lamsade, Paris Dauphine University in 2013 [2].
His research interests include Linear temporal logic (LTL) model checking, Monte-Carlo tree search, Proof-number search and General Game Playing. Along with Tristan Cazenave, Abdallah Saffidine is co-author of the Hex program Yopt, which performs Monte-Carlo Tree Search.
Contents
Selected Publications
2009
- Abdallah Saffidine (2009). LTL Model Checking with use of Generalised Stuttering and Characteristic Patterns.
2010 ...
- Abdallah Saffidine (2010). Some Improvements for Monte-Carlo Tree Search, Game Description Language Compilation, Score Bounds and Transpositions. MSc-Thesis, Lamsade, Paris Dauphine University, advisor Tristan Cazenave
- Tristan Cazenave, Abdallah Saffidine (2010). Monte-Carlo Hex. pdf
- Abdallah Saffidine, Tristan Cazenave, Jean Méhat (2010). UCD : Upper Confidence bound for rooted Directed acyclic graphs. TAAI IWCG
- Tristan Cazenave, Abdallah Saffidine (2010). Score Bounded Monte-Carlo Tree Search. CG 2010
2011
- Abdallah Saffidine (2011). Moccos wins the Panthom-Go Tournament. ICGA Journal, Vol. 34, No. 1 » 15th Computer Olympiad
- Abdallah Saffidine, Nicolas Jouandeau, Tristan Cazenave (2011). Solving breakthrough with Race Patterns and Job-Level Proof Number Search. Advances in Computer Games 13 » Breakthrough (Game)
- Abdallah Saffidine, Tristan Cazenave (2011). A forward chaining based game description language compiler. GIGA 2011
2012
- Abdallah Saffidine (2012). Minimal Proof Search for Modal Logic K Model Checking. CoRR, July 2012 [4]
- Abdallah Saffidine, Tristan Cazenave (2012). Multiple-Outcome Proof Number Search. ECAI 2012 » Proof-Number Search
- Abdallah Saffidine, Hilmar Finnsson, Michael Buro (2012). Alpha-Beta Pruning for Games with Simultaneous Moves. AAAI 2012
- Abdallah Saffidine, Tristan Cazenave, Jean Méhat (2012). UCD : Upper confidence bound for rooted directed acyclic graphs. Knowledge Based Systems, Vol. 34
- Marc Lanctot, Abdallah Saffidine, Joel Veness, Christopher Archibald (2012). Sparse Sampling for Adversarial Games. ECAI CGW 2012
- Abdallah Saffidine, Tristan Cazenave (2012). A General Multi-Agent Modal Logic K Framework for Game Tree Search. ECAI CGW 2012
2013
- Marc Lanctot, Abdallah Saffidine, Joel Veness, Christopher Archibald, Mark Winands (2013). Monte Carlo *-Minimax Search. IJCAI 2013
- Abdallah Saffidine (2013). Solving Games and All That. Ph.D. thesis, Université Paris-Dauphine, advisor Tristan Cazenave, pdf [5]
- Édouard Bonnet, Florian Jamain, Abdallah Saffidine (2013). Havannah and TwixT are PSPACE-complete. CG 2013 [6]
- Abdallah Saffidine, Tristan Cazenave (2013). Developments on Product Propagation. CG 2013, pdf
- Abdallah Saffidine, Nicolas Jouandeau, Cédric Buron, Tristan Cazenave (2013). Material Symmetry to Partition Endgame Tables. CG 2013
- Édouard Bonnet, Florian Jamain, Abdallah Saffidine (2013). On the Complexity of Trick-Taking Card Games. IJCAI 2013 [7]
2014
- Abdallah Saffidine (2014). The Game Description Language is Turingcomplete. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 6, No. 4
- Édouard Bonnet, Abdallah Saffidine (2014). On the Complexity of General Game Playing. ECAI CGW 2014
2015 ...
- Marie-Liesse Cauwet, Olivier Teytaud, Hua-Min Liang, Shi-Jim Yen, Hung-Hsuan Lin, I-Chen Wu, Tristan Cazenave, Abdallah Saffidine (2015). Depth, balancing, and limits of the Elo model. IEEE Conference on Computational Intelligence and Games 2015, arXiv:1511.02006
- Olivier Teytaud, Abdallah Saffidine, Shi-Jim Yen (2015). The complexities of Go. Advances in Computer Games 14
- Édouard Bonnet, Florian Jamain, Abdallah Saffidine (2015). Draws, Zugzwangs, and PSPACE-Completeness in the Slither Connection Game. Advances in Computer Games 14
- Édouard Bonnet, Florian Jamain, Abdallah Saffidine (2016). On the Complexity of Connection Games. arXiv:1605.04715
- Tristan Cazenave, Abdallah Saffidine, Michael Schofield, Michael Thielscher (2016). Nested Monte Carlo Search for Two-Player Games. AAAI 2016, pdf
- Tristan Cazenave, Abdallah Saffidine, Nathan Sturtevant (2019). Computer Games Workshop at IJCAI 2018. ICGA Journal, Vol. 41, No. 2
2020 ...
- Tristan Cazenave, Jaap van den Herik, Abdallah Saffidine, I-Chen Wu (2020). The ACG 2019 Conference. ICGA Journal, Vol. 42, No. 4 » Advances in Computer Games 16
External Links
References
- ↑ Abdallah Saffidine - Google Scholar Citations
- ↑ Abdallah Saffidine (2013). Solving Games and All That. Ph.D. thesis, Université Paris-Dauphine, advisor Tristan Cazenave
- ↑ dblp: Abdallah Saffidine
- ↑ Modal logic from Wikipedia
- ↑ Dap Hartmann (2013). From to αβ to ABCD and SMAB. Review. ICGA Journal, Vol. 36, No. 4
- ↑ PSPACE-complete from Wikipedia
- ↑ Trick-taking game from Wikipedia