Ronald+de+Man

toc
 * Home * People * Ronald de Man**

a Dutch mathematician, computer scientist and IP lawyer, in the 90s researcher at [|Eindhoven University of Technology], competitor at the [|International Mathematical Olympiad] 1990, winning the Silver medal, and the [|ACM International Collegiate Programming Contest] 1995, to win Bronze within the //ARoMA// team from Delft University of Technology. He is co-developer of the Linux [|desktop environment] and [|graphical user interface] [|GNOME], and as chess programmer author of the chess and Antichess playing program Sjaak, which plays at FICS under the handle //TrojanKnight//. He further ported Stockfish to plain C, dubbed CFish.  =Scoring Root Moves= Ronald de Man proposed a method to apply randomness and/or bonuses, i.e. developing bonus, or penalties suggested by an oracle, in scoring moves at the root without any changes in alpha-beta search or leaf evaluation, and without any problems with the transposition table :
 * Ronald de Man**, [|alias] [|Syzygy],

code value = -Search(-beta, -alpha,...) code in code value = bonus[n] - Search(bonus[n]-beta, bonus[n]-alpha,...) code


 * 1) If v <= alpha, then x <= alpha,
 * 2) If v >= beta, then x >= beta,
 * 3) If alpha < v < beta, then x = v.

||

=Bloom Filter= Ronald de Man revealed the trick to speed up repetition detection with a [|Bloom filter], implemented as a small hash table indexed by some lower bits of the hash-key, to increment a counter while entering and decrement the counter while leaving a node.

=Syzygy Bases= In April 2013, Ronald de Man published his Syzygy Bases, a compact endgame tablebase of up to six pieces. It consist of two sets of files, **WDL** files storing win/draw/loss information considering the fifty-move rule, for access during search, and **DTZ** files with distance-to-zero information for access at the root.

=Selected Publications=
 * Ronald de Man (**1995**). //[|On Composants of Solenoids]//. [|Fundamenta Mathematicae] 147, [|pdf]
 * Ronald de Man (**1999**). //[|The Generating Function for the Number of Roots of a Coxeter Group]//. [|Journal of Symbolic Computation, Vol. 27, No.6]
 * [|Richa Malhotra], [|Ronald van Haalen], Ronald de Man, [|Michiel van Everdingen] (**2003**) //[|Managing service-level agreements in metro ethernet networks using backpressure]//. [|Bell Labs Technical Journal, Vol. 8, No. 2].

=Forum Posts=
 * [|Re: random play] by Ronald de Man, rgcc, November 28, 1996
 * [|Re: Hash functions for use with a transition table] by Ronald de Man, rgcc, March 7, 1997 » BCH Hashing
 * [|Re: computer chess "oracle" ideas...] by Ronald de Man, rgcc, April 3, 1997 » Oracle
 * [|Re: computer chess "oracle" ideas...] by Ronald de Man, rgcc, April 7, 1997
 * [|Re: triple repetition] by Ronald de Man, rgcc, October 27, 1997
 * [|New 6-piece tablebases] by Ronald de Man, CCC, April 01, 2013 » Syzygy Bases
 * [|tablebase caching / mmap / page cache] by Ronald de Man, CCC, October 13, 2013 » Memory, Endgame Tablebases, Syzygy Bases
 * [|Question to syzygy author] by Marco Costalba, CCC, April 24, 2016
 * [|tablebase compression / academic integrity] by Ronald de Man, CCC, May 19, 2016

=External Links= > [|Syzygy (mathematics) from Wikipedia]
 * [|syzygy1/tb · GitHub] by Ronald de Man » Syzygy Bases
 * [|Syzygy from Wikipedia]
 * [|ICGA: Losing Chess] by Guy Haworth

=References= =What links here?= include page="Ronald de Man" component="backlinks" limit="100"
 * Up one level**