Changes

Jump to: navigation, search

Rainer Feldmann

2 bytes removed, 12:59, 18 March 2019
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]]. 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 OrganizerDirector|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> .
[[Category:Chess Programmer|Feldmann]]
[[Category:Researcher|Feldmann]]
[[Category:Tournament OrganizerDirector|Feldmann]]

Navigation menu