Changes

Jump to: navigation, search

Rainer Feldmann

113 bytes added, 16:49, 30 May 2018
no edit summary
'''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]]. Together Along with [[Peter Mysliwietz]], Rainer Feldmann is co-author 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 [[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-ThesisPh.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> .
=Photos=
* 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. [[Burkhard Monien]], Th. Ottmann (eds.), Springer, Lecture Notes in Computer Science[https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS], Vol. 594, 1992, 270-288[https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]* [[Rainer Feldmann]] ('''1993'''). ''Game Tree Search on Massively Parallel Systems''. Phd-ThesisPh.D. 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]

Navigation menu