Dr. Rainer Feldmann, a German computer games researcher and chess programmer, member of the research group of Burkhard Monien at the University of Paderborn. Together with Peter Mysliwietz, Rainer Feldmann is co-author of the massive parallel chess program Zugzwang applying the Young Brothers Wait Concept, and the single processor program Alpha I [1] . 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 [2] and introduced Fail-High Reductions, as implemented in Zugzwang [3] .
Rainer Feldmann [4]

Photos

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

See also

• Alpha I
• Fail-High Reductions
• IPCCC
• Parallel Search
• University of Paderborn
• 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, University of Paderborn
• Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Oliver Vornberger (1989). Distributed Game-Tree Search. ICCA Journal, Vol. 12, No. 2 ^[9]

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 ^[10]
• 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, B. Monien, Th. Ottmann (eds.), Springer, Lecture Notes in Computer Science, 594, 1992, 270-288
• Rainer Feldmann (1993). Game Tree Search on Massively Parallel Systems. Phd-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

External Links

• Rainer Feldmann's homepage
• Rainer Feldmann's ICGA Tournaments

References

1. ^ Rainer Feldmann's ICGA Tournaments
2. ^ Feldmann, R. (1993). Game Tree Search on Massively Parallel Systems. Phd-Thesis, pdf
3. ^ Feldmann, R. (1997). Fail-High Reductions. Advances in Computer Chess 8, pdf from CiteSeerX
4. ^ Rainer Feldmann's homepage
5. ^ Ein Besuch in Paderborn 1998 by Thorsten Czub
6. ^ Dr. rer. nat. Rainer Feldmann - Publications
7. ^ Rainer Feldmann - Publication List Details at Scientific Commons
8. ^ Rainer Feldmann's papers at CiteSeerX
9. ^ Jonathan Schaeffer (1989). Comment on 'Distributed Game-Tree Search'. ICCA Journal, Vol. 12, No. 4
10. ^ Jonathan Schaeffer (1990). A Rejoinder to the Response to a Comment on 'Distributed Game-Tree Search'. ICCA Journal, Vol. 13, No. 1

What links here?