25,161
edits
Changes
no edit summary
'''Onno Garms''',<br/>
a German mathematician, computer scientist and awarded <ref>[https://www.innovations-report.de/html/berichte/foerderungen-preise/bericht-62246.html Verleihung des Joseph-von-Fraunhofer-Preises 2002] (German)</ref> researcher at [https://en.wikipedia.org/wiki/Fraunhofer_Society Fraunhofer Institute] for Algorithms and Scientific Computing [https://en.wikipedia.org/wiki/SCAI SCAI]. He holds a diplom degree in mathematics and a Ph.D. in computer science both from [https://en.wikipedia.org/wiki/University_of_Bonn University of Bonn] in 1999 and 2006 respectively. His research interests include a broad range of [https://en.wikipedia.org/wiki/Optimization_problem optimization problems] such as [https://en.wikipedia.org/wiki/Packing_problems packing problems] along with [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity theory].
As former youth chess player and autodidact programmer, he developed the chess engine [[Onno]], which was commercially released in 2009 <ref>[http://www.onnochess.com/index.html Welcome to onnochess.com!]</ref>. In March 2011, Onno Garms announced he stopped the development of Onno <ref>[http://www.talkchess.com/forum/viewtopic.php?t=38403 Development of Onno ends] by [[Onno Garms]], [[CCC]], March 13, 2011</ref>, and revealed several ideas that made Onno stronger.
