Changes

a Dutch computer scientiestand professor and scientific director of the Leiden institute for artificial intelligence and computer science (LIACS), [[Leiden University]]. In 1993 he started as a PhD student He studied [[Artificial Intelligence|artificial intelligence]] under the guidance of [[Jonathan Schaeffer]] at the [[University of Alberta]] , and [[Arie de Bruin]] and [[Wim Pijls]] at the [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus UniversityRotterdam] Rotterdamwhere he obtained his Ph.D. in 1996. In 1997 he was a As postdoc at [[Massachusetts Institute of Technology|MIT's]] LCS, where he worked with [[Charles Leiserson]] and [[Don Dailey]] on [[Cilkchess]] at the Supercomputing Technologies Group. Until 1999 , he was researcher in the Computer Systems Group of the [https://en.wikipedia.org/wiki/Vrije_Universiteit Vrije Universiteit] in Amsterdam , where he worked with [[Henri Bal]] on Wide Area Algorithms[https://en.wikipedia.org/wiki/Distributed_algorithm distributed algorithms]. Next, he Aske Plaat worked in IT Governance at [https://en.wikipedia.org/wiki/PricewaterhouseCoopers PriceWaterhouse Coopers], and the [https://en.wikipedia.org/wiki/Ministry_of_Security_and_Justice_%28Netherlands%29 Ministry of Justice] in the , The Netherlands. Since October 2009 , he is professor of information and complex decision making at [[Tilburg University]]. Since , since 2014 he is professor of data science at the Leiden Centre of Data Science, Leiden Institute of Advanced Computer Science (LIACS), affiliated with [[Leiden University]].  Aske Plaat is creator of the [[MTD(f)]] <ref>[https://people.csail.mit.edu/plaat/mtdf.html - A Minimax Algorithm faster than NegaScout]</ref> search algorithm as applied in [[Cilkchess ]] <ref>[https://www.game-ai-forum.org/icga-tournaments/person.php?id=425 Aske Plaat's ICGA Tournaments]</ref>. He is deputy editor of the [[ICGA Journal|Journal of the International Computer Games Association]] [[ICGA]].