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
Edouard Bonnet
Edit
0
14
…
3
Tags
chessplayer
mathematician
people
Notify
RSS
Backlinks
Source
Print
Export (PDF)
Home
*
People
* Édouard Bonnet
Édouard Bonnet
,
a French chess player
[1]
, mathematician and computer scientist with a Ph.D. in 2014 from
Lamsade
,
Paris Dauphine University
, where his advisors include
Vangelis Th. Paschos
. His research interests centers around
algorithms
,
computational complexity
and
games
.
Édouard Bonnet
[2]
Table of Contents
PSPACE-complete
Selected Publications
2013 ...
2015 ...
External Links
References
What links here?
PSPACE-complete
Along with
Florian Jamain
and
Abdallah Saffidine
, Edouard Bonnet proved the
connection games
Havannah
and
TwixT
[3]
are in the
PSPACE-complete
class of complexity
due to
reduction
by encoding games already known to be PSPACE-complete into the target games.
Hex
[4]
could be encoded into TwixT, and
Generalized geography
to Havannah
[5]
.
Selected Publications
[6]
2013 ...
Édouard Bonnet
,
Vangelis Th. Paschos
(
2013
).
An exact algorithm for 1-in-3 SAT
.
CoRR, July 2013
[7]
Édouard Bonnet
,
Florian Jamain
,
Abdallah Saffidine
(
2013
).
Havannah and TwixT are PSPACE-complete
.
CG 2013
Édouard Bonnet
,
Florian Jamain
,
Abdallah Saffidine
(
2013
).
On the Complexity of Trick-Taking Card Games
.
IJCAI 2013
[8]
Édouard Bonnet
,
Abdallah Saffidine
(
2014
).
On the Complexity of General Game Playing
.
ECAI CGW 2014
Édouard Bonnet
(
2014
).
Positive and Negative Results in Approximation and Parameterized Complexity
. (Résultats Positifs et Négatifs en Approximation et Complexité Paramétrée) Ph.D. thesis,
Paris Dauphine University
,
pdf
2015 ...
É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
Édouard Bonnet
(
2017
).
Analytical Solution for "EinStein würfelt nicht!" with One Stone
.
Advances in Computer Games 15
External Links
Édouard Bonnet - Home Page
Edouard Bonnet | LinkedIn
The chess games of Edouard Bonnet
from
chessgames.com
Bonnet, Edouard - FIDE Chess Profile
Grenoble Echecs Tournois externes
References
^
When a Shogi champion turns to chess
,
ChessBase News
, May 17, 2002
^
Édouard Bonnet - Home Page
^
TwixT from Wikipedia
^
Stefan Reisch
(
1981
).
Hex ist PSPACE-vollständig
.
Acta Informatica Vol. 15, No. 2
(German)
^
Édouard Bonnet
,
Florian Jamain
,
Abdallah Saffidine
(
2013
).
Havannah and TwixT are PSPACE-complete
.
CG 2013
^
dblp: Edouard Bonnet
^
Exactly-1 3-satisfiability - Wikipedia
^
Trick-taking game from Wikipedia
What links here?
Page
Date Edited
Abdallah Saffidine
Aug 11, 2017
Advances in Computer Games 14
Aug 11, 2017
Advances in Computer Games 15
Aug 12, 2017
CG 2013
Jul 18, 2017
ECAI CGW 2014
Jul 18, 2017
Edouard Bonnet
Aug 13, 2017
EinStein würfelt nicht!
Aug 11, 2017
Florian Jamain
Aug 11, 2017
General Game Playing
Dec 22, 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], mathematician and computer scientist with a Ph.D. in 2014 from Lamsade, Paris Dauphine University, where his advisors include Vangelis Th. Paschos. His research interests centers around algorithms, computational complexity and games.
Table of Contents
PSPACE-complete
Along with Florian Jamain and Abdallah Saffidine, Edouard Bonnet proved the connection games Havannah and TwixT [3] are in the PSPACE-complete class of complexity due to reduction by encoding games already known to be PSPACE-complete into the target games. Hex [4] could be encoded into TwixT, and Generalized geography to Havannah [5].Selected Publications
[6]2013 ...
2015 ...
External Links
References
What links here?
Up one level