Thomas Anantharaman

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages) This biography of a living person needs additional citations for verification. Please help by adding reliable sources. Contentious material about living persons that is unsourced or poorly sourced must be removed immediately from the article and its talk page, especially if potentially libelous. Find sources: "Thomas Anantharaman" – news · newspapers · books · scholar · JSTOR (May 2010) (Learn how and when to remove this message) This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (May 2010) (Learn how and when to remove this message) (Learn how and when to remove this message)

Thomas S. Anantharaman is a computer statistician specializing in Bayesian inference approaches for NP-complete problems. He is best known for his work with Feng-hsiung Hsu from 1985 to 1990 on the Chess playing computers ChipTest and Deep Thought at Carnegie Mellon University which led to his 1990 PhD Dissertation: "A Statistical Study of Selective Min-Max Search in Computer Chess". This work was the foundation for the IBM chess-playing computer Deep Blue which beat world champion Garry Kasparov in 1997.