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]].

<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf [ICGA Journal#RefDB|ICGA Reference Database] (pdf)]</ref> <ref>[httphttps://www.informatikdblp.uni-trier.de/~ley/pers/hd/p/Plaat:Aske dblp: Aske Plaat]</ref>

* [[Arie de Bruin]], [[Wim Pijls]], [[Aske Plaat]] ('''1994'''). ''Solution Trees as a Basis for Game Tree Search.'' Technical Report EUR-CS-94-04, Department of Computer Science, [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University Rotterdam]. [http://publishing.eur.nl/ir/repub/asset/1456/eur-few-cs-94-04.pdf pdf]* [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1994, 2014'''). ''[http://arxiv.org/abs/1404.1518?context=cs.AI Nearly Optimal Minimax Tree Search?]'' Technical Report, [[University of Alberta]], [https://arxiv.org/abs/1404.1518 arXiv:1404.1518]* [[Arie de Bruin]], [[Wim Pijls]], [[Aske Plaat]] ('''1994'''). ''[https://content.iospress.com/articles/icga-journal/icg17-4-04 Solution Trees as a Basis for Game-Tree Search].'' [[ICGA Journal#17_4|ICCA Journal, Vol. 17, No. 4]]* [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1994, 2014'''). ''[http://arxiv.org/abs/1404.1517?context=cs.AI SSS* = aAlpha-b Beta + TT]''. TR-CS-94-17, [[University of Alberta]], [https://arxiv.org/abs/1404.1517 arXiv:1404.1517]* [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1994, 2014'''). ''A New Paradigm for Minimax Search''. TR-CS 94-18, [[University of Alberta]], [httphttps://arxiv.org/abs/1404.1515?context=csarXiv:1404.AI A New Paradigm for Minimax Search1515]''. TR 94-18

* [[Wim Pijls]], [[Arie de Bruin]], [[Aske Plaat]] ('''1995'''). ''Solution Trees as a Basis for Game Tree Search.'' Tech. Report EUR-CS-95-01, Department of Computer Science, [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University , Rotterdam]* [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1995, 2015'''). ''Best-First Fixed Depth Game Tree Search in Practice.'' Proceedings of International Joint Conference on Artificial Intelligence ([[Conferences#IJCAI1995|IJCAI-95), Vol. 1, pp. 273-279. Montreal]], Quebec, Canada. [httphttps://webdocsarxiv.cs.ualberta.caorg/%7Ejonathanabs/Papers/Papers/ijcai1505.01603 arXiv:1505.ps ps01603]

* [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1996'''). ''Best-First Fixed-Depth Minimax Algorithms.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29Artificial (journal) Artificial Intelligence], Vol. 87, Nos. 1-2, [http://www.ldc.usb.ve/~bonet/courses/ci5437/papers/mtd.pdf pdf]

* [[Jonathan Schaeffer]], [[Aske Plaat]] ('''1996'''). ''New Advances in Alpha-Beta Searching.'' Proceedings of the 1996 ACM Computer Science Conference, pp. 124[[Conferences#AAAI-96|AAAI-130. ACM Press, New York, N.Y. [http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=31382842138FDC0DD1E608AE6841D951?doi=10.1.1.51.7078&rep=rep1&type=pdf pdf96] from [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.7078 CiteSeerX]* [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1996'''). ''Exploiting Graph Properties of Game Trees.'' [[Conferences#AAAI-96|AAAI-96]] » [[Enhanced Transposition Cutoff]]* [[Aske Plaat]], Vol[[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1996, 2017'''). ''A Minimax Algorithm Better Than Alpha-beta?: No and Yes''. 1, [httphttps://citeseerx.ist.psuarxiv.eduorg/viewdocabs/download;jsessionid=812B9CDE7707A402265713DD254EE227?doi=101702.103401 arXiv:1702.1.50.3346&rep=rep1&type=pdf pdf] » [[Enhanced Transposition Cutoff]03401]* [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1996'''). ''An Algorithm Faster than NegaScout and SSS* in Practice''. [http://citeseerx.ist.psu.edu/showciting;jsessionidviewdoc/download?doi=10.1.1.77.9111&rep=04E25D5F074D8B5BABB68D2AC5BA5D39?cidrep1&type=3161130 pdf pdf] from [httphttps://citeseerxen.istwikipedia.psu.eduorg/viewdocwiki/summary?doi=10.1.1.50.8641 CiteSeerX CiteSeerX], covers » [[MTD(f)]]

* [[Aske Plaat]] ('''1997, 2014'''). ''[http://arxiv.org/abs/1404.1511?context=cs.AI MTD(f), A Minimax Algorithm Faster Than NegaScout]''. Internal Report, [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University Rotterdam], [https://arxiv.org/abs/1404.1511?context=cs.AI arXiv:1404.1511]

* [[Aske Plaat]], [[Arie de Bruin]], [[Jonathan Schaeffer]], [[Wim Pijls]] ('''1999'''). ''A Minimax Algorithm better than SSS*.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 87* [[John Romein]], [[Aske Plaat]], [[Henri Bal]], [[Jonathan Schaeffer]] ('''1999'''). ''Transposition Table Driven Work Scheduling in Distributed Search''. [[Conferences#AAAI-99|AAAI-99]], [https://www.aaai.org/Papers/AAAI/1999/AAAI99-103.pdf pdf] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=57343&start=5 Re: scorpio can run on 8192 cores] by [[Daniel Shawul]], [[CCC]], August 29, 2015</ref> <ref>[https://en.wikipedia.org/wiki/Transposition-driven_scheduling Transposition-driven scheduling - Wikipedia]</ref>

* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2015'''). ''Parallel Monte Carlo Tree Search from Multi-core to Many-core Processors''. [https://whova.com/portal/ieeet_201508/ TrustCom/BigDataSE/|ISPA 2015], [https://askeplaat.files.wordpress.com/2013/01/ispa2015.pdf pdf]