Changes

a Turkish computer scientist and Assistant Professor at [https://en.wikipedia.org/wiki/Ko%C3%A7_University Koç University], [https://en.wikipedia.org/wiki/Istanbul Istanbul]. He received his B.S., M.S., and Ph.D. degrees from the [[Massachusetts Institute of Technology]] in 1992-2000. His research interests includes [[Learning|machine learning]] and [https://en.wikipedia.org/wiki/Computational_linguistics computational linguistics]. At MIT he worked with [[David McAllester]] on [[Conspiracy Number Search]] and the [[Depth-First|depth-first]] [[Alpha-Beta Conspiracy Search]] (ABC search), which uses [[Conspiracy Numbers|conspiracy theory]] and disjoint [[Depth|depths]] of max- and min-player to control [[Selectivity|selectivity]] and [[Extensions|extensions]] of a an [[Alpha-Beta|alpha-beta]] search. In his paper ''The Principle of Pressure in Chess'', Deniz Yuret introduces the [[Best-First|best-first]] [[Pressure Search]] algorithm, and concerning [[Selectivity|selectivity]] further mentions the [[ACM 1993]] and its winner [[Socrates]] aka [[Titan]], and corporate experiments with the Socrates team at MIT on new algorithms <ref>[[Deniz Yuret]] ('''1994'''). ''[https://scholar.google.com/citations?view_op=view_citation&hl=en&user=EJurXJ4AAAAJ&cstart=40&citation_for_view=EJurXJ4AAAAJ:TQgYirikUcIC The Principle of Pressure in Chess]''. TAINN 1994</ref>.