Changes

Jump to: navigation, search

Rainer Feldmann

7,491 bytes added, 16:42, 30 May 2018
Created page with "'''Home * People * Rainer Feldmann''' FILE:rainerfeldmann.jpg|border|right|thumb|link=http://www.uni-paderborn.de/person/113/| Rainer Feldmann <ref>[http..."
'''[[Main Page|Home]] * [[People]] * Rainer Feldmann'''

[[FILE:rainerfeldmann.jpg|border|right|thumb|link=http://www.uni-paderborn.de/person/113/| Rainer Feldmann <ref>[http://www.uni-paderborn.de/person/113/ Rainer Feldmann - Universität Paderborn]</ref> ]]

'''Rainer Feldmann''',<br/>
a German computer games researcher and chess programmer, member of the research group of [[Burkhard Monien]] at the [[Paderborn University]]. Together with [[Peter Mysliwietz]], Rainer Feldmann is co-author 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 [[Tournament Organizers|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''. Phd-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> .

=Photos=
[[FILE:chrillyvincerainer.jpg|none|border|text-bottom|560px|link=http://www.thorstenczub.de/Paderborn.html]]
[[Chrilly Donninger|Chrilly]], [[Vincent Diepeveen|Vincent]], [[Ulf Lorenz|Ulf]] (back) and Rainer, [[IPCCC 1998]] <ref>[http://www.thorstenczub.de/Paderborn.html Ein Besuch in Paderborn 1998] by [[Thorsten Czub]]</ref>

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

=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hd/f/Feldmann:Rainer dblp: Rainer Feldmann]</ref>
==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''. [[ICGA Journal#12_2|ICCA Journal, Vol. 12, No. 2]] <ref>[[Jonathan Schaeffer]] ('''1989'''). ''Comment on Distributed Game-Tree Search''. [[ICGA Journal#12_4|ICCA Journal, Vol. 12, No. 4]]</ref>
==1990 ...==
* [[Rainer Feldmann]], [[Burkhard Monien]], [[Peter Mysliwietz]], [[Oliver Vornberger]] ('''1990'''). ''Response to a Comment on Distributed Game-Tree Search''. [[ICGA Journal#13_1|ICCA Journal, Vol. 13, No. 1]] <ref>[[Jonathan Schaeffer]] ('''1990'''). ''A Rejoinder to the Response to a Comment on Distributed Game-Tree Search''. [[ICGA Journal#13_1|ICCA Journal, Vol. 13, No. 1]]</ref>
* [[Rainer Feldmann]], [[Peter Mysliwietz]], [[Burkhard Monien]] ('''1991'''). ''A Fully Distributed Chess Program''. [[Advances in Computer Chess 6]], [http://www.top-5000.nl/ps/A%20fully%20distribuited%20chess%20program.pdf pdf]
* Anne Marie Burton, [[Peter Mysliwietz]], [[Rainer Feldmann]] ('''1991'''). ''Report on the 1st International Paderborn Computer Chess Championship''. [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]] » [[IPCCC 1991]]
* [[Rainer Feldmann]], [[Peter Mysliwietz]], [[Burkhard Monien]] ('''1992'''). ''Experiments with a Fully Distributed Chess Program''. [[3rd Computer Olympiad#Workshop|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, [http://www2.cs.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/feldmann_phd.pdf 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''. [[ICGA Journal#18_3|ICCA Journal, Vol. 18, No. 3]]
* [[Rainer Feldmann]] ('''1995'''). ''[[WMCCC 1995|The 13th World Microcomputer-Chess Championship]]. Results and Selected Games''. [[ICGA Journal#18_4|ICCA Journal, Vol. 18, No. 4]]
* [[Rainer Feldmann]] ('''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]
* [[Rainer Feldmann]], [[Burkhard Monien]] ('''1998'''). ''[http://www2.cs.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/ABSTRACTS/FM_T3E.html Selective Game Tree Search on a Cray T3E]''. [http://www2.cs.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/FM_T3E.ps.Z ps]
* [[Burkhard Monien]], [[Rainer Feldmann]], [[Jaap van den Herik]] ('''1999'''). ''More Information on the 9th World Computer-Chess Championship''. [[ICGA Journal#22_1|ICCA Journal, Vol. 22, No. 1]], [http://arno.uvt.nl/show.cgi?fid=107328 pdf] » [[WCCC 1999]]
==2000 ...==
* [[Rainer Feldmann]], [[Burkhard Monien]], [[Stefan Schamberger]] ('''2000'''). ''A Distributed Algorithm to Evaluate Quantified Boolean Formulae''. AAAI-00 Proceedings, [http://www.aaai.org/Papers/AAAI/2000/AAAI00-044.pdf pdf]
* [[Burkhard Monien]], [[Rainer Feldmann]] (Eds.) ('''2002'''). ''[https://link.springer.com/book/10.1007%2F3-540-45706-2 Euro-Par 2002 Parallel Processing]''. [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS], Vol. 2400, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
: [[Rainer Feldmann]], [https://dblp.uni-trier.de/pers/hd/r/Roucairol:Catherine Catherine Roucairol] ('''2002'''). ''[https://link.springer.com/chapter/10.1007/3-540-45706-2_129 Discrete Optimization]''.
* [[Rainer Feldmann]] ('''2005'''). ''Selfish Routing of Splittable Flow with Respect to Maximum Congestion''. [https://dblp.uni-trier.de/db/conf/dagstuhl/P5011.html Computing and Markets 2005], [https://pdfs.semanticscholar.org/95cd/275b0bda148e91625bca3882441d684af4f7.pdf pdf]
* [[Rainer Feldmann]], [https://scholar.google.com/citations?user=PAACT74AAAAJ&hl=en Marios Mavronicolas], [[Burkhard Monien]] ('''2009'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-10841-9_26 Nash Equilibria for Voronoi Games on Transitive Graphs]''. [https://dblp.uni-trier.de/db/conf/wine/wine2009.html WINE 2009], [https://pdfs.semanticscholar.org/bd97/15d439e49db3ee3cfa452892a511fb12f1bb.pdf pdf]

=External Links=
* [http://www.uni-paderborn.de/person/113/ Rainer Feldmann - Universität Paderborn]
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=119 Rainer Feldmann's ICGA Tournaments]

=References=
<references />

'''[[People|Up one level]]'''

Navigation menu