Raghuram Ramanujan

From Chessprogramming wiki
Revision as of 17:45, 3 June 2018 by GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Raghuram Ramanujan''' FILE:RaghuramRamanujan.jpg|border|right|thumb|Raghuram Ramanujan <ref>Capture from [http://videolectures.net/icap...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Home * People * Raghuram Ramanujan

Raghuram Ramanujan [1]

Raghuram Ramanujan,
an Indian American electrical engineer, computer scientist and assistant professor at Davidson College, Davidson, North Carolina. He holds a degree in electrical and computer engineering from Purdue University, and a M.Sc. and Ph.D. in CS, 2012 from Cornell University. His research interests span multiple areas of artificial intelligence, including automated planning, combinatorial search, and machine learning [2].


Along with Ashish Sabharwal, and Bart Selman, Raghuram Ramanujan researched on Upper Confidence bounds applied to Trees (UCT). Quote from their abstract On Adversarial Search Spaces and Sampling-Based Planning [3]:

UCT has been shown to outperform traditional minimax based approaches in several challenging domains such as Go and Kriegspiel, although minimax search still prevails in other domains such as Chess. This work provides insights into the properties of adversarial search spaces that play a key role in the success or failure of UCT and similar sampling-based approaches. We show that certain "early loss" or "shallow trap" configurations, while unlikely in Go, occur surprisingly often in games like Chess (even in grandmaster games). We provide evidence that UCT, unlike minimax search, is unable to identify such traps in Chess and spends a great deal of time exploring much deeper game play than needed. 

Selected Publications


External Links


Up one level