Difference between revisions of "Rainer Feldmann"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 4: | Line 4: | ||
'''Rainer Feldmann''',<br/> | '''Rainer Feldmann''',<br/> | ||
| − | 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 Search|parallel]] chess program [[Zugzwang (Program)|Zugzwang]] applying the [[Young Brothers Wait Concept]], and the single processor program [[Alpha I]] <ref>[https://www.game-ai-forum.org/icga-tournaments/person.php?id=119 Rainer Feldmann's ICGA Tournaments]</ref> . Rainer and Peter were also [[:Category:Tournament | + | 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 Search|parallel]] chess program [[Zugzwang (Program)|Zugzwang]] applying the [[Young Brothers Wait Concept]], and the single processor program [[Alpha I]] <ref>[https://www.game-ai-forum.org/icga-tournaments/person.php?id=119 Rainer Feldmann's ICGA Tournaments]</ref> . Rainer and Peter were also [[:Category:Tournament Director|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'' <ref>Feldmann, R. ('''1993'''). ''Game Tree Search on Massively Parallel Systems''. Ph.D. thesis, [http://wwwcs.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/feldmann_phd.pdf pdf]</ref> and introduced [[Fail-High Reductions]], as implemented in Zugzwang <ref>Feldmann, R. ('''1997'''). ''Fail-High Reductions.'' [[Advances in Computer Chess 8]], [http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=4399933A9FAE32A9C855DED714120C66?doi=10.1.1.51.4897&rep=rep1&type=pdf pdf] from [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.4897 CiteSeerX]</ref> . | Rainer Feldmann holds a Ph.D. on ''Game Tree Search on Massively Parallel Systems'' <ref>Feldmann, R. ('''1993'''). ''Game Tree Search on Massively Parallel Systems''. Ph.D. thesis, [http://wwwcs.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/feldmann_phd.pdf pdf]</ref> and introduced [[Fail-High Reductions]], as implemented in Zugzwang <ref>Feldmann, R. ('''1997'''). ''Fail-High Reductions.'' [[Advances in Computer Chess 8]], [http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=4399933A9FAE32A9C855DED714120C66?doi=10.1.1.51.4897&rep=rep1&type=pdf pdf] from [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.4897 CiteSeerX]</ref> . | ||
| Line 55: | Line 55: | ||
[[Category:Chess Programmer|Feldmann]] | [[Category:Chess Programmer|Feldmann]] | ||
[[Category:Researcher|Feldmann]] | [[Category:Researcher|Feldmann]] | ||
| − | [[Category:Tournament | + | [[Category:Tournament Director|Feldmann]] |
Revision as of 12:59, 18 March 2019
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] .
Contents
Photos
Chrilly, Vincent, Ulf (back) and Rainer, IPCCC 1998 [5]
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 [7]
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 [8]
- 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 [9]
- 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 (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
References
- ↑ Rainer Feldmann - Universität Paderborn
- ↑ Rainer Feldmann's ICGA Tournaments
- ↑ Feldmann, R. (1993). Game Tree Search on Massively Parallel Systems. Ph.D. thesis, pdf
- ↑ Feldmann, R. (1997). Fail-High Reductions. Advances in Computer Chess 8, pdf from CiteSeerX
- ↑ Ein Besuch in Paderborn 1998 by Thorsten Czub
- ↑ dblp: Rainer Feldmann
- ↑ Jonathan Schaeffer (1989). Comment on Distributed Game-Tree Search. ICCA Journal, Vol. 12, No. 4
- ↑ Jonathan Schaeffer (1990). A Rejoinder to the Response to a Comment on Distributed Game-Tree Search. ICCA Journal, Vol. 13, No. 1
- ↑ Forschungszentrum Jülich schickt Cray T-3 zur Schachweltmeisterschaft, June 09, 1999, Computerwoche (German) » WCCC 1999
