Rainer Feldmann

Home * People * Rainer Feldmann



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. 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 and introduced Fail-High Reductions, as implemented in Zugzwang.

=Photos= Chrilly, Vincent, Ulf (back) and Rainer, IPCCC 1998

=See also=
 * Alpha I
 * Fail-High Reductions
 * IPCCC
 * Parallel Search
 * Paderborn University
 * Young Brothers Wait Concept
 * Zugzwang (Program)

=Selected Publications=

1986 ...

 * Rainer Feldmann, Peter Mysliwietz, Oliver Vornberger (1986). A Local Area Network Used as a Parallel Architecture. Technical Report 31, Paderborn University
 * Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Oliver Vornberger (1989). Distributed Game-Tree Search. ICCA Journal, Vol. 12, No. 2

1990 ...

 * Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Oliver Vornberger (1990). Response to a Comment on Distributed Game-Tree Search. ICCA Journal, Vol. 13, No. 1
 * Rainer Feldmann, Peter Mysliwietz, Burkhard Monien (1991). A Fully Distributed Chess Program. Advances in Computer Chess 6, pdf
 * Anne Marie Burton, Peter Mysliwietz, Rainer Feldmann (1991). Report on the 1st International Paderborn Computer Chess Championship. ICCA Journal, Vol. 14, No. 4 » IPCCC 1991
 * Rainer Feldmann, Peter Mysliwietz, Burkhard Monien (1992). Experiments with a Fully Distributed Chess Program. Heuristic Programming in AI 3
 * Rainer Feldmann, Peter Mysliwietz, Burkhard Monien (1992). Distributed Game Tree Search on a Massively Parallel System. Data Structures and Efficient Algorithms, Burkhard Monien, Th. Ottmann (eds.), LNCS, Vol. 594, Springer
 * Rainer Feldmann (1993). Game Tree Search on Massively Parallel Systems. Ph.D. thesis, pdf
 * Rainer Feldmann, Peter Mysliwietz, Burkhard Monien (1994). Game-Tree Search on a Massively Parallel System. Advances in Computer Chess 7
 * Ulf Lorenz, Valentin Rottmann, Rainer Feldmann, Peter Mysliwietz (1995). Controlled Conspiracy-Number Search. ICCA Journal, Vol. 18, No. 3
 * Rainer Feldmann (1995). The 13th World Microcomputer-Chess Championship. Results and Selected Games. ICCA Journal, Vol. 18, No. 4
 * Rainer Feldmann (1997). Fail-High Reductions. Advances in Computer Chess 8, pdf from CiteSeerX
 * Rainer Feldmann, Burkhard Monien (1998). Selective Game Tree Search on a Cray T3E. ps
 * Burkhard Monien, Rainer Feldmann, Jaap van den Herik (1999). More Information on the 9th World Computer-Chess Championship. ICCA Journal, Vol. 22, No. 1, pdf » WCCC 1999

2000 ...

 * Rainer Feldmann, Burkhard Monien, Stefan Schamberger (2000). A Distributed Algorithm to Evaluate Quantified Boolean Formulae. AAAI-00 Proceedings, pdf
 * Burkhard Monien, Rainer Feldmann (Eds.) (2002). Euro-Par 2002 Parallel Processing. LNCS, Vol. 2400, Springer
 * Rainer Feldmann, Catherine Roucairol (2002). Discrete Optimization.


 * Rainer Feldmann (2005). Selfish Routing of Splittable Flow with Respect to Maximum Congestion. Computing and Markets 2005, pdf
 * Rainer Feldmann, Marios Mavronicolas, Burkhard Monien (2009). Nash Equilibria for Voronoi Games on Transitive Graphs. WINE 2009, pdf

=External Links=
 * Rainer Feldmann - Universität Paderborn
 * Rainer Feldmann's ICGA Tournaments

=References= Up one level