This is a temporary, read-only recovery of the chessprogrammingwiki while a longer-term plan is worked out. Editing is not possible right now, but will be again soon.
Chess Programming Wiki All pages Other namespaces

Bernhard Balkenhol

Home * People * Bernhard Balkenhol

Bernhard Balkenhol 1Bernhard Balkenhol 1


  1. Dr. Bernhard Balkenhol - Homepage↩︎

Bernhard Balkenhol,
a German mathematician, computer scientist and authorized officer and CEO in the IT industry 1. Until 2014, he served as visiting lecturer at Bielefeld University, where he already received a diplom in 1992, and a Ph.D. degree in 1995 under supervision of Rudolf Ahlswede and Ingo Althöfer. His research interests include search algorithms and data compression. Based on Jürg Nievergelt's idea of asking a sequence of yes-no-questions 2, Balkenhol elaborated on compression in encoding typical chess positions with less than 136 bits, as published in the ICCA Journal 3.

Contents
  1. Selected Publications
    1. 1990 ...
    2. 2000 ...
  2. External Links
  3. References

Selected Publications

4 5

1990 ...

2000 ...

References

Up one level


  1. Bernhard Balkenhol | LinkedIn↩︎

  2. Jürg Nievergelt (1977). Information content of chess positions. ACM SIGART Newsletter, Vol. 62↩︎

  3. Bernhard Balkenhol (1994). Data Compression in Encoding Chess Positions. ICCA Journal, Vol. 17, No. 3, zipped ps↩︎

  4. dblp: Bernhard Balkenhol↩︎

  5. Dr. Bernhard Balkenhol - Publications↩︎

Categories: Mathematician · Researcher

What links here

Contributors: GerdIsenberg.