Nicolaas de Bruijn

From Chessprogramming wiki
Jump to: navigation, search

Home * People * Nicolaas de Bruijn

Nicolaas Govert de Bruijn [1]

Nicolaas Govert de Bruijn, (July 9, 1918 – February 17, 2012 [2])
was a Dutch mathematician, covering many areas of mathematics. Eponym of the De Bruijn Sequences [3] - as used for instance in computer chess programming to scan bits of set-wise representations such as Bitboards [4].

According to De Bruijn himself [5], the existence of De Bruijn sequences for each order were first proved, for the case of alphabets with two elements, by Camille Flye Sainte-Marie in 1894, whereas the generalization to larger alphabets is originally due to Tanja van Ardenne-Ehrenfest [6] and himself.

Selected Publications

See also

External Links

De Bruijn–Erdős theorem from Wikipedia
De Bruijn graph from Wikipedia
De Bruijn index from Wikipedia
De Bruijn–Newman constant from Wikipedia
De Bruijn notation from Wikipedia
De Bruijn sequence from Wikipedia
De Bruijn's theorem from Wikipedia
De Bruijn torus from Wikipedia


  1. Nicolaas Govert de Bruijn - biography © July 2008 by J J O'Connor and E F Robertson School of Mathematics and Statistics, University of St Andrews, Scotland
  2. Process Algebra Diary: Nicolaas Govert de Bruijn (1918-2012)
  3. De Bruijn sequence from Wikipedia
  4. Charles E. Leiserson, Harald Prokop, Keith H. Randall (1998). Using de Bruijn Sequences to Index a 1 in a Computer Word. pdf
  5. Nicolaas de Bruijn (1975). Acknowledgement of priority to C. Flye Sainte-Marie on the counting of circular arrangements of 2n zeros and ones that show each n-letter word exactly once. Technical Report, Technische Hogeschool Eindhoven, pdf
  6. Nicolaas de Bruijn (1985). In Memoriam T. van Ardenne-Ehrenfest. pdf

Up one level