Michel Van den Bergh's professional interests in mathematics is supplemented by chess and computer chess programming. He worked on Toga IIPosix ports [3], on icsdrone, an interface between an ICS (Internet Chess Server) and a chess engine supporting the Chess Engine Communication Protocol[4], and made an attempt to transform GNU Chess into a modern Chess Engine Communication Protocol compliant engine. He is in the process to improve version 5 with various SEE based pruning techniques and optimizations, where SEESign is faster to determine if the SEE value is below some threshold than computing its actual value [5], and further applied parameter tuning using Rémi Coulom'sCLOP, Confident Local Optimization for Noisy Black-Box Parameter Tuning [6].
Michel Van den Bergh (1984). A duality theorem for Hopf algebras, Methods in ring theory. (Antwerp, 1983), NATO Advanced Science Institutes Series C: Mathematical and Physical Sciences, Vol. 129, Reidel, Dordrecht[8]
a Belgian mathematician, Ph.D. in 1985 and Habilitation (Hoger Aggregaat) in 1990 from University of Antwerp, and director of research at the Fund for Scientific Research, also affiliated with the University of Hasselt, Diepenbeek, and the Free University of Brussels. He was visiting researcher and professor at MIT in Cambridge, Massachusetts, the Louis Pasteur University in Strasbourg, the Mathematical Sciences Research Institute in Berkeley, California, and the Mittag Leffler Institute in Stockholm [1].
Table of Contents
Computer Chess
Michel Van den Bergh's professional interests in mathematics is supplemented by chess and computer chess programming. He worked on Toga II Posix ports [3], on icsdrone, an interface between an ICS (Internet Chess Server) and a chess engine supporting the Chess Engine Communication Protocol [4], and made an attempt to transform GNU Chess into a modern Chess Engine Communication Protocol compliant engine. He is in the process to improve version 5 with various SEE based pruning techniques and optimizations, where SEESign is faster to determine if the SEE value is below some threshold than computing its actual value [5], and further applied parameter tuning using Rémi Coulom's CLOP, Confident Local Optimization for Noisy Black-Box Parameter Tuning [6].Selected Publications
[7]1980 ...
1990 ...
2000 ...
2010 ...
Forum Posts
2008 ...
2010 ...
- Confused by futility pruning by Michel Van den Bergh, CCC, March 03, 2010 » Futility Pruning
- protocol specs by Michel Van den Bergh, CCC, March 11, 2010 » XBoard
- GNUChess for Android by Michel Van den Bergh, CCC, December 24, 2010
2011- icsdroneng 0.23 released by Michel Van den Bergh, CCC, June 10, 2011
- gnuchess 5.07.173b by Michel Van den Bergh, CCC, September 19, 2011
- Question on parallel search by Michel Van den Bergh, CCC, December 27, 2011 » Parallel Search
2012- icsdroneng 0.25 released by Michel Van den Bergh, CCC, January 20, 2012
- Thinking output ordering and failing low by Michel Van den Bergh, CCC, March 18, 2012
- icsdrone by Michel Van den Bergh, CCC, July 30, 2012
- Sjeng 11.2 and suicide chess by Michel Van den Bergh, CCC, September 03, 2012 » Sjeng
- GnuChess 5.07.174.1b by Michel Van den Bergh, CCC, October 20, 2012
2013- GNU Chess 5.50 by Michel Van den Bergh, CCC, April 16, 2013
- 1 draw=1 win + 1 loss (always!) by Michel Van den Bergh, CCC, September 19, 2013
20142015 ...
Re: The SPRT without draw model, elo model or whatever.. by Michel Van den Bergh, CCC, August 18, 2016 » SPRT Python code [19]
External Links
General
Computer Chess
References
What links here?
Up one level