Rémi Coulom

From Chessprogramming wiki
Jump to: navigation, search

Home * People * Rémi Coulom

Rémi Coulom [1]

Rémi Coulom,
a French computer scientist, freelance programmer in the field of artificial intelligence in games, and former associate professor (Maître de Conférences) of computer science at the Charles de Gaulle University – Lille III, and a member of the GRAPPA and SequeL research groups, in Lille, France [2] . Rémi contributed to computer chess with his famous chess program The Crazy Bishop, the Bayesian Elo Rating system [3] and the Treemap search-tree visualization. The Crazy Bishop was one of the pioneers in supporting the Chess Engine Communication Protocol.

His more recent research interests focus on the more challenging domains. His Lines of Action program Lola and Computer Go playing program Crazy Stone deal with Monte-Carlo Tree Search and Neural Networks, and as of May 2016, Deep Learning [4]. His generic AlphaZero implementation dubbed CrazyZero has networks trained to play Go, Shogi, Gomoku, Othello, Renju, and Chess [5].

Rémi is further co-author of Erica in supervising primary author Aja Huang. At the Advances in Computer Games 13 conference in Tilburg, 2011, Rémi introduced CLOP, Confident Local Optimization for Noisy Black-Box Parameter Tuning [6] [7]. Rémi Coulom was board member of the ICGA as Programmers Representative, superseded in November 2011 by Mark Lefler. He also did the excellent Web site development of the ICGA Tournament Database.


The Crazy Bishop

from the 9th French Computer Chess Championship, Massy, 2002 [8]


Chess Wizard vs The Crazy Bishop, Frédéric Louguet, Rémi Coulom, FCCC 2002


Stéphane, Jean-Philippe, Bernard, Sylvain, Franck, Frédéric, Bruno L, Pascal, Bruno B, Rémi, Eric [9]

Gold with Crazy Stone


11th Computer Olympiad, Go 9x9, Ken Chen, Rémi Coulom, Hiroshi Yamashita and Jaap van den Herik [10]

Open Source

Post by Rémi Coulom on open source 1997 [11] :

In the last release of The Crazy Bishop, I have added a part of the source code. Here is what I added to the web page:
I will not distribute the source code of TCB. I fear that distributing it can have unpleasant consequences, such as the risk of meeting a modified version in a tournament, which happened to Crafty in Jakarta. I think that keeping the code secret is a good way to preserve the fun of competition.
However, this distribution includes the source code of the C++ chess library used by TCB, along with a very simple (and poor) chess engine demonstrating how to use it. This chess library could be useful for people wanting to write their own chess program. By subclassing the CEngine class, you will be able to concentrate on the programming of the chess engine only, and the class library will give you for free a console user interface, xboard/Zippy interface, search tree analysis tools, pgn file input/output, and more to come in future versions. Since no programer showed interest in this class library yet, it is not documented for more than my personal use. If my code raises some interest among programmers, I will add the necessary documentation.
Some students in a French school have to write a chess program as a project, and decided to use my chess library. This means that I will probably add documentation soon.
By the way, new improvements will be added very soon to my web page. (probably before tomorrow). I am testing changes I have made this week end before I publish them. TCB 0026 is now about 10% faster than the previous version, with a better positional evaluation.

Selected Publications


2000 ...

2005 ...

2010 ...

Forum Posts

1997 ...

2000 ...

2005 ...

2010 ...

2015 ...

External Links

Crazy Stone
Crazy Sensei
Bayesian Elo Rating
CLOP for Noisy Black-Box Parameter Optimization


Up one level