Skip to main content
guest
Join
|
Help
|
Sign In
chessprogramming
Home
guest
|
Join
|
Help
|
Sign In
Wiki Home
Recent Changes
Pages and Files
Members
Home
Basics
Getting Started
Board Representation
Search
Evaluation
Principle Topics
Chess
Programming
Artificial Intelligence
Knowledge
Learning
Testing
Tuning
User Interface
Protocols
Dictionary
Lists
Arts
Cartoons
CC Forums
Conferences
Dedicated CC
Engines
Games
Hardware
History
Organizations
Papers
People
Periodical
Samples
Software
Timeline
Tournaments and Matches
Videos
Misc
Acknowledgments
On New Pages
Recommended Reading
Wikispaces Help
Florian Jamain
Edit
0
8
…
3
Tags
chessplayer
mathematician
people
Notify
RSS
Backlinks
Source
Print
Export (PDF)
Home
*
People
* Florian Jamain
Florian Jamain
,
a French chess player
[1]
, 2012
TwixT
[2]
world champion at the
Mind Sports Olympiad
[3]
, computer scientist and mathematician with a Ph.D. in 2014 from
Paris Dauphine University
under
Cristina Bazgan
. His research interests include
algorithms
,
computational complexity
and
games
.
Florian Jamain
[4]
Table of Contents
PSPACE-complete
Selected Publications
External Links
References
What links here?
PSPACE-complete
Along with
Edouard Bonnet
and
Abdallah Saffidine
, Florian Jamain proved the
connection games
Havannah
and
TwixT
are
PSPACE-complete
, due to
reduction
in encoding games already known to be PSPACE-complete into the target games.
Hex
[5]
could be encoded into TwixT, and
Generalized geography
to Havannah
[6]
.
Selected Publications
[7]
Edouard Bonnet
,
Florian Jamain
,
Abdallah Saffidine
(
2013
).
Havannah and TwixT are PSPACE-complete
.
CG 2013
Edouard Bonnet
,
Florian Jamain
,
Abdallah Saffidine
(
2013
).
On the Complexity of Trick-Taking Card Games
.
IJCAI 2013
[8]
Florian Jamain
(
2014
).
Discrete representations of the nondominated set for multi-objective optimization problems
. (
Représentations discrètes de l'ensemble des points non dominés pour des problèmes d'optimisation multi-objectifs
). Ph.D. thesis,
Paris Dauphine University
É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
External Links
Florian Jamain - Google+
Jamain, Florian FIDE Chess Profile
References
^
Jamain, Florian FIDE Chess Profile
^
TwixT from Wikipedia
^
Mind Sports Olympiad - Twixt
^
Florian Jamain - Google+
^
Stefan Reisch
(
1981
).
Hex ist PSPACE-vollständig
.
Acta Informatica Vol. 15, No. 2
(German)
^
Edouard Bonnet
,
Florian Jamain
,
Abdallah Saffidine
(
2013
).
Havannah and TwixT are PSPACE-complete
.
CG 2013
^
dblp: Florian Jamain
^
Trick-taking game from Wikipedia
What links here?
Page
Date Edited
Abdallah Saffidine
Aug 11, 2017
Advances in Computer Games 14
Aug 11, 2017
CG 2013
Jul 18, 2017
Edouard Bonnet
Aug 13, 2017
Florian Jamain
Aug 11, 2017
Havannah
Jan 8, 2017
Mathematician
Apr 9, 2018
People
Feb 28, 2018
University of Paris
Nov 26, 2015
Up one level
Javascript Required
You need to enable Javascript in your browser to edit pages.
help on how to format text
Turn off "Getting Started"
Home
...
Loading...
a French chess player [1], 2012 TwixT [2] world champion at the Mind Sports Olympiad [3], computer scientist and mathematician with a Ph.D. in 2014 from Paris Dauphine University under Cristina Bazgan. His research interests include algorithms, computational complexity and games.
Table of Contents
PSPACE-complete
Along with Edouard Bonnet and Abdallah Saffidine, Florian Jamain proved the connection games Havannah and TwixT are PSPACE-complete, due to reduction in encoding games already known to be PSPACE-complete into the target games. Hex [5] could be encoded into TwixT, and Generalized geography to Havannah [6].Selected Publications
[7]External Links
References
What links here?
Up one level