Rainer Feldmann

From Chessprogramming wiki
Jump to: navigation, search

Home * People * Rainer Feldmann

Rainer Feldmann [1]

Rainer Feldmann,
a German computer scientist, games researcher and former chess programmer. He was member of the research group of Burkhard Monien at the Paderborn University. Along with Peter Mysliwietz, Rainer Feldmann co-authored of the massive parallel chess program Zugzwang applying the Young Brothers Wait Concept, and the single processor program Alpha I [2] . Rainer and Peter were also tournament organizers as well as participants and three times winner of the earlier International Paderborn Computer Chess Championships IPCCC. Rainer Feldmann holds a Ph.D. on Game Tree Search on Massively Parallel Systems [3] and introduced Fail-High Reductions, as implemented in Zugzwang [4] .



Chrilly, Vincent, Ulf (back) and Rainer, IPCCC 1998 [5]

See also

Selected Publications


1986 ...

1990 ...

1995 ...

2000 ...

Rainer Feldmann, Catherine Roucairol (2002). Discrete Optimization.

2005 ...

External Links


  1. Rainer Feldmann - Universität Paderborn
  2. Rainer Feldmann's ICGA Tournaments
  3. Feldmann, R. (1993). Game Tree Search on Massively Parallel Systems. Ph.D. thesis, pdf
  4. Feldmann, R. (1997). Fail-High Reductions. Advances in Computer Chess 8, pdf from CiteSeerX
  5. Ein Besuch in Paderborn 1998 by Thorsten Czub
  6. dblp: Rainer Feldmann
  7. Jonathan Schaeffer (1989). Comment on Distributed Game-Tree Search. ICCA Journal, Vol. 12, No. 4
  8. Jonathan Schaeffer (1990). A Rejoinder to the Response to a Comment on Distributed Game-Tree Search. ICCA Journal, Vol. 13, No. 1
  9. Forschungszentrum Jülich schickt Cray T-3 zur Schachweltmeisterschaft, June 09, 1999, Computerwoche (German) » WCCC 1999

Up one level