25,161
edits
Changes
Created page with "'''Home * People * Aske Plaat''' border|right|thumb|link=http://plaat.nl/| Aske Plaat <ref>[http://plaat.nl/ plaat.nl]</ref> '''As..."
'''[[Main Page|Home]] * [[People]] * Aske Plaat'''
[[FILE:AskePlaat.jpg|border|right|thumb|link=http://plaat.nl/| Aske Plaat <ref>[http://plaat.nl/ plaat.nl]</ref> ]]
'''Aske Plaat''',<br/>
a Dutch computer scientiest. In 1993 he started as a PhD student at the [[University of Alberta]] , and at the [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University] Rotterdam. In 1997 he was a 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 on Wide Area Algorithms. Next, he 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 Netherlands. Since October 2009 he is professor of information and complex decision making at [[Tilburg University]]. Since 2014 he is professor of data science at the Leiden Centre of Data Science, Leiden Institute of Advanced Computer Science (LIACS), [[Leiden University]]. Aske Plaat is creator of the [[MTD(f)]] <ref>[http://plaat.nl/mtdf.html Aske Plaat: MTD(f), a new chess algorithm]</ref> <ref>[http://people.csail.mit.edu/plaat/mtdf.html MTD(f) - 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]].
=See also=
* [[Advances in Computer Games 13#Video|Advances in Computer Games 13 | Video]]
* [[Cilkchess]]
* [[Jos Vermaseren#HEPGAME|HEPGAME]]
* [[MTD(f)]]
* [[SSS* and Dual*]]
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[http://www.informatik.uni-trier.de/~ley/pers/hd/p/Plaat:Aske dblp: Aske Plaat]</ref>
==1994==
* [[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'''). ''[http://arxiv.org/abs/1404.1518?context=cs.AI Nearly Optimal Minimax Tree Search?]'' Technical Report, [[University of Alberta]]
* [[Arie de Bruin]], [[Wim Pijls]], [[Aske Plaat]] ('''1994'''). ''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'''). ''[http://arxiv.org/abs/1404.1517?context=cs.AI SSS* = a-b TT]''. TR-CS-94-17, [[University of Alberta]]
* [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1994'''). ''[http://arxiv.org/abs/1404.1515?context=cs.AI A New Paradigm for Minimax Search]''. TR 94-18
==1995==
* [[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'''). ''Best-First Fixed Depth Game Tree Search in Practice.'' Proceedings of International Joint Conference on Artificial Intelligence (IJCAI-95), Vol. 1, pp. 273-279. Montreal, Quebec, Canada. [http://webdocs.cs.ualberta.ca/%7Ejonathan/Papers/Papers/ijcai.ps ps]
==1996==
* [[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 Intelligence], Vol. 87, Nos. 1-2, [http://www.ldc.usb.ve/~bonet/courses/ci5437/papers/mtd.pdf pdf]
* [[Aske Plaat]] ('''1996'''). ''[http://www.cs.vu.nl/~aske/Papers/abstr-ks.html Research Re: Search & Re-Search]''. Ph.D. thesis, Erasmus University, Rotterdam, The Netherlands.
* [[Jonathan Schaeffer]], [[Aske Plaat]] ('''1996'''). ''New Advances in Alpha-Beta Searching.'' Proceedings of the 1996 ACM Computer Science Conference, pp. 124-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 pdf] 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.'' [[AAAI|AAAI-96]], Vol. 1, [http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=812B9CDE7707A402265713DD254EE227?doi=10.1.1.50.3346&rep=rep1&type=pdf pdf] » [[Enhanced Transposition Cutoff]]
* [[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;jsessionid=04E25D5F074D8B5BABB68D2AC5BA5D39?cid=3161130 pdf] from [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.8641 CiteSeerX], covers [[MTD(f)]]
* [[Yngvi Björnsson]], [[Mark Brockington]], [[Andreas Junghanns]], [[Aske Plaat]] ('''1996'''). ''Report on the Advances in Computer Chess 8 Conference''. [[ICGA Journal#19_3|ICCA Journal, Vol. 19, No. 3]] » [[Advances in Computer Chess 8]]
==1997 ...==
* [[Aske Plaat]] ('''1997'''). ''[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]
* [[Jonathan Schaeffer]], [[Aske Plaat]] ('''1997'''). ''Kasparov versus Deep Blue: The Rematch''. [[ICGA Journal#20_2|ICCA Journal, Vol. 20, No. 2]]
* [[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''. [[AAAI|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>
==2000 ...==
* [[Jonathan Schaeffer]], [[Aske Plaat]], [[Andreas Junghanns]] ('''2001'''). ''Unifying Single-agent and Two-player search.'' Information Sciences, Vol. 135, [http://webdocs.cs.ualberta.ca/~jonathan/Papers/Papers/search.ps ps]
* [[John Romein]], [[Henri Bal]], [[Jonathan Schaeffer]], [[Aske Plaat]] ('''2002'''). ''A Performance Analysis of Transposition-Table-Driven Scheduling in Distributed Search''. IEEE Transactions on Parallel and Distributed Systems, Vol. 13, No. 5, pp. 447–459. [http://www.cs.vu.nl/~bal/Papers/tds.pdf pdf] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=47700 Transposition driven scheduling] by [[Daniel Shawul]], [[CCC]], April 04, 2013</ref>
==2010 ...==
* [[Jaap van den Herik]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2010'''). ''The JAIST Computer Olympiad''. [[ICGA Journal#33_3|ICGA Journal, Vol. 33, No. 3]] » [[15th Computer Olympiad]]
* [[Jaap van den Herik]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2010'''). ''The JAIST Computer Olympiad (Part 2)''. [[ICGA Journal#33_4|ICGA Journal, Vol. 33, No. 4]]
'''2011'''
* [[Jaap van den Herik]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2011'''). ''The JAIST Computer Olympiad (Part 3)''. [[ICGA Journal#34_1|ICGA Journal, Vol. 34, No. 1]]
* [[Jaap van den Herik]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2011'''). ''The JAIST Computer Olympiad (Part 4)''. [[ICGA Journal#34_2|ICGA Journal, Vol. 34, No. 2]]
'''2012'''
* [[Jaap van den Herik]], [[Aske Plaat]] ('''2012'''). ''The 13th Advances in Computer Games Conference''. [[ICGA Journal#35_1|ICGA Journal, Vol. 35, No. 1]] » [[Advances in Computer Games 13]]
* [[Jaap van den Herik]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2012'''). ''The 16th Computer Olympiad''. [[ICGA Journal#35_1|ICGA Journal, Vol. 35, No. 1]] » [[16th Computer Olympiad]]
* [[Jaap van den Herik]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2012'''). ''The 16th Computer Olympiad (part 2)''. [[ICGA Journal#35_2|ICGA Journal, Vol. 35, No. 2]]
* [[Jaap van den Herik]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2012'''). ''The 16th Computer Olympiad (part 3)''. [[ICGA Journal#35_4|ICGA Journal, Vol. 35, No. 4]]
* [[Jan Kuipers (Nikhef)|Jan Kuipers]], [[Aske Plaat]], [[Jos Vermaseren]], [[Jaap van den Herik]] ('''2012'''). ''Improving multivariate Horner schemes with Monte Carlo tree search''. [http://arxiv.org/abs/1207.7079 CoRR abs/1207.7079]
'''2013'''
* [[Mohamed Abbadi]], [[Francesco Di Giacomo]], [[Giuseppe Maggiore]], [[Aske Plaat]], [[Renzo Orsini]], [[Pieter Spronck]] ('''2013'''). ''Resources, Entities, Actions. A generalized design pattern for RTS games and its language extension in Casanova''. [[CG 2013]], [http://askeplaat.files.wordpress.com/2013/01/main.pdf pdf]
* [[Jaap van den Herik]], [[Hiroyuki Iida]], [[Aske Plaat]] ('''2013'''). ''The 8th Computers and Games Conference''. [[ICGA Journal#36_3|ICGA Journal, Vol. 36, No. 3]] » [[CG 2013]]
* [[Jaap van den Herik]], [[Hiroyuki Iida]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2013'''). ''The Brain and Mind Sports Olympiad''. [[ICGA Journal#36_3|ICGA Journal, Vol. 36, No. 3]] » [[17th Computer Olympiad]]
* [[Jaap van den Herik]], [[Hiroyuki Iida]], [[Aske Plaat]] ('''2013'''). ''The 8th Computers and Games Conference (Part 2)''. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]] » [[CG 2013]]
* [[Jaap van den Herik]], [[Hiroyuki Iida]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2013'''). ''The Brain and Mind Sports Olympiad (Part 2)''. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]] » [[17th Computer Olympiad]]
* [[Ben Ruijl]], [[Jos Vermaseren]], [[Aske Plaat]], [[Jaap van den Herik]] ('''2013'''). ''Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification''. [http://arxiv.org/abs/1312.0841 CoRR abs/1312.0841]
'''2014'''
* [[Aske Plaat]] ('''2014'''). ''Don Dailey, 1956-2013, an Obituary''. [[ICGA Journal#37_1|ICGA Journal, Vol 37, No. 1]] » [[Don Dailey]]
* [[Ben Ruijl]], [[Jos Vermaseren]], [[Aske Plaat]], [[Jaap van den Herik]] ('''2014'''). ''HEPGAME and the Simplification of Expressions''. [http://arxiv.org/abs/1405.6369 CoRR abs/1405.6369]
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2014'''). ''Performance analysis of a 240 thread tournament level MCTS Go program on the Intel Xeon Phi''. [http://arxiv.org/abs/1409.4297 CoRR abs/1409.4297] » [[Go]], [[Monte-Carlo Tree Search|MCTS]]
* [[Ben Ruijl]], [[Jos Vermaseren]], [[Aske Plaat]], [[Jaap van den Herik]] ('''2014'''). ''Why Local Search Excels in Expression Simplification''. [http://arxiv.org/abs/1409.5223 CoRR abs/1409.5223]
* [[Jaap van den Herik]], [[Aske Plaat]], [[David Levy]], [[Daniel Dimov]] ('''2014'''). ''[http://www.sciencedirect.com/science/article/pii/S1875952114000093 Plagiarism in Game Programming Competitions]''. [http://www.journals.elsevier.com/entertainment-computing/ Entertainment Computing], Vol. 5, No. 3, [http://askeplaat.files.wordpress.com/2013/01/the-application-of-the-icga-rules-v15.pdf pdf preprint]
* [[Jaap van den Herik]], [[Hiroyuki Iida]], [[Aske Plaat]] (eds.) ('''2014'''). ''[http://link.springer.com/book/10.1007/978-3-319-09165-5 Computers and Games: 8th International Conference, CG 2013, Yokohama, Japan, August 13-15, 2013, Revised Selected Papers]''. [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS] 8427, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], ISBN-13: 978-3-319-09164-8 » [[CG 2013]] <ref>[[Dap Hartmann]] ('''2014'''). ''A Statue of unremitting Devotion. Revised Selected papers CG 2013''. (Review) [[ICGA Journal#37_3|ICGA Journal, Vol. 37, No. 3]]</ref>
* [http://dblp.uni-trier.de/pers/hd/a/Absalom:Richard Richard Absalom], [http://scholar.google.com/citations?user=CxVcDicAAAAJ&hl=en Marcus Luczak-Rosch], [[Dap Hartmann]], [[Aske Plaat]] ('''2014'''). ''Crowd-Sourcing Fuzzy and Faceted Classification for Concept Search''. [http://arxiv.org/abs/1406.7749 arXiv:1406.7749], [http://dblp.uni-trier.de/db/journals/corr/corr1406.html#AbsalomLHP14 CoRR, June 2014]
==2015 ...==
* [[Taichi Ishitobi]], [[Aske Plaat]], [[Hiroyuki Iida]], [[Jaap van den Herik]] ('''2015'''). ''Reducing the Seesaw Effect with Deep Proof Number Search''. [[Advances in Computer Games 14]]
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2015'''). ''Scaling Monte Carlo Tree Search on Intel Xeon Phi''. [http://arxiv.org/abs/1507.04383 CoRR abs/1507.04383] » [[Hex]], [[Monte-Carlo Tree Search|MCTS]], [[Parallel Search]], [[x86-64]]
* [[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]
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]] ('''2015'''). ''Ensemble UCT Needs High Exploitation''. [http://arxiv.org/abs/1509.08434 CoRR abs/1509.08434]
* [[Jaap van den Herik]], [[Walter Kosters]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2015'''). ''The 18th Computer Olympiad 2015''. [[ICGA Journal#38_4|ICGA Journal, Vol. 38, No. 4]] » [[18th Computer Olympiad]]
=External Links=
* [http://plaat.nl/ Aske Plaat - homepage]
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=425 Aske Plaat's ICGA Tournaments]
* [http://people.csail.mit.edu/plaat/resume.html Resume of Aske Plaat]
* [http://www.linkedin.com/in/askeplaat/ Aske Plaat - LinkedIn]
* [http://plaat.nl/mtdf.html Aske Plaat: MTD(f), a new chess algorithm]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:AskePlaat.jpg|border|right|thumb|link=http://plaat.nl/| Aske Plaat <ref>[http://plaat.nl/ plaat.nl]</ref> ]]
'''Aske Plaat''',<br/>
a Dutch computer scientiest. In 1993 he started as a PhD student at the [[University of Alberta]] , and at the [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University] Rotterdam. In 1997 he was a 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 on Wide Area Algorithms. Next, he 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 Netherlands. Since October 2009 he is professor of information and complex decision making at [[Tilburg University]]. Since 2014 he is professor of data science at the Leiden Centre of Data Science, Leiden Institute of Advanced Computer Science (LIACS), [[Leiden University]]. Aske Plaat is creator of the [[MTD(f)]] <ref>[http://plaat.nl/mtdf.html Aske Plaat: MTD(f), a new chess algorithm]</ref> <ref>[http://people.csail.mit.edu/plaat/mtdf.html MTD(f) - 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]].
=See also=
* [[Advances in Computer Games 13#Video|Advances in Computer Games 13 | Video]]
* [[Cilkchess]]
* [[Jos Vermaseren#HEPGAME|HEPGAME]]
* [[MTD(f)]]
* [[SSS* and Dual*]]
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[http://www.informatik.uni-trier.de/~ley/pers/hd/p/Plaat:Aske dblp: Aske Plaat]</ref>
==1994==
* [[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'''). ''[http://arxiv.org/abs/1404.1518?context=cs.AI Nearly Optimal Minimax Tree Search?]'' Technical Report, [[University of Alberta]]
* [[Arie de Bruin]], [[Wim Pijls]], [[Aske Plaat]] ('''1994'''). ''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'''). ''[http://arxiv.org/abs/1404.1517?context=cs.AI SSS* = a-b TT]''. TR-CS-94-17, [[University of Alberta]]
* [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1994'''). ''[http://arxiv.org/abs/1404.1515?context=cs.AI A New Paradigm for Minimax Search]''. TR 94-18
==1995==
* [[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'''). ''Best-First Fixed Depth Game Tree Search in Practice.'' Proceedings of International Joint Conference on Artificial Intelligence (IJCAI-95), Vol. 1, pp. 273-279. Montreal, Quebec, Canada. [http://webdocs.cs.ualberta.ca/%7Ejonathan/Papers/Papers/ijcai.ps ps]
==1996==
* [[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 Intelligence], Vol. 87, Nos. 1-2, [http://www.ldc.usb.ve/~bonet/courses/ci5437/papers/mtd.pdf pdf]
* [[Aske Plaat]] ('''1996'''). ''[http://www.cs.vu.nl/~aske/Papers/abstr-ks.html Research Re: Search & Re-Search]''. Ph.D. thesis, Erasmus University, Rotterdam, The Netherlands.
* [[Jonathan Schaeffer]], [[Aske Plaat]] ('''1996'''). ''New Advances in Alpha-Beta Searching.'' Proceedings of the 1996 ACM Computer Science Conference, pp. 124-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 pdf] 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.'' [[AAAI|AAAI-96]], Vol. 1, [http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=812B9CDE7707A402265713DD254EE227?doi=10.1.1.50.3346&rep=rep1&type=pdf pdf] » [[Enhanced Transposition Cutoff]]
* [[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;jsessionid=04E25D5F074D8B5BABB68D2AC5BA5D39?cid=3161130 pdf] from [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.8641 CiteSeerX], covers [[MTD(f)]]
* [[Yngvi Björnsson]], [[Mark Brockington]], [[Andreas Junghanns]], [[Aske Plaat]] ('''1996'''). ''Report on the Advances in Computer Chess 8 Conference''. [[ICGA Journal#19_3|ICCA Journal, Vol. 19, No. 3]] » [[Advances in Computer Chess 8]]
==1997 ...==
* [[Aske Plaat]] ('''1997'''). ''[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]
* [[Jonathan Schaeffer]], [[Aske Plaat]] ('''1997'''). ''Kasparov versus Deep Blue: The Rematch''. [[ICGA Journal#20_2|ICCA Journal, Vol. 20, No. 2]]
* [[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''. [[AAAI|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>
==2000 ...==
* [[Jonathan Schaeffer]], [[Aske Plaat]], [[Andreas Junghanns]] ('''2001'''). ''Unifying Single-agent and Two-player search.'' Information Sciences, Vol. 135, [http://webdocs.cs.ualberta.ca/~jonathan/Papers/Papers/search.ps ps]
* [[John Romein]], [[Henri Bal]], [[Jonathan Schaeffer]], [[Aske Plaat]] ('''2002'''). ''A Performance Analysis of Transposition-Table-Driven Scheduling in Distributed Search''. IEEE Transactions on Parallel and Distributed Systems, Vol. 13, No. 5, pp. 447–459. [http://www.cs.vu.nl/~bal/Papers/tds.pdf pdf] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=47700 Transposition driven scheduling] by [[Daniel Shawul]], [[CCC]], April 04, 2013</ref>
==2010 ...==
* [[Jaap van den Herik]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2010'''). ''The JAIST Computer Olympiad''. [[ICGA Journal#33_3|ICGA Journal, Vol. 33, No. 3]] » [[15th Computer Olympiad]]
* [[Jaap van den Herik]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2010'''). ''The JAIST Computer Olympiad (Part 2)''. [[ICGA Journal#33_4|ICGA Journal, Vol. 33, No. 4]]
'''2011'''
* [[Jaap van den Herik]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2011'''). ''The JAIST Computer Olympiad (Part 3)''. [[ICGA Journal#34_1|ICGA Journal, Vol. 34, No. 1]]
* [[Jaap van den Herik]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2011'''). ''The JAIST Computer Olympiad (Part 4)''. [[ICGA Journal#34_2|ICGA Journal, Vol. 34, No. 2]]
'''2012'''
* [[Jaap van den Herik]], [[Aske Plaat]] ('''2012'''). ''The 13th Advances in Computer Games Conference''. [[ICGA Journal#35_1|ICGA Journal, Vol. 35, No. 1]] » [[Advances in Computer Games 13]]
* [[Jaap van den Herik]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2012'''). ''The 16th Computer Olympiad''. [[ICGA Journal#35_1|ICGA Journal, Vol. 35, No. 1]] » [[16th Computer Olympiad]]
* [[Jaap van den Herik]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2012'''). ''The 16th Computer Olympiad (part 2)''. [[ICGA Journal#35_2|ICGA Journal, Vol. 35, No. 2]]
* [[Jaap van den Herik]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2012'''). ''The 16th Computer Olympiad (part 3)''. [[ICGA Journal#35_4|ICGA Journal, Vol. 35, No. 4]]
* [[Jan Kuipers (Nikhef)|Jan Kuipers]], [[Aske Plaat]], [[Jos Vermaseren]], [[Jaap van den Herik]] ('''2012'''). ''Improving multivariate Horner schemes with Monte Carlo tree search''. [http://arxiv.org/abs/1207.7079 CoRR abs/1207.7079]
'''2013'''
* [[Mohamed Abbadi]], [[Francesco Di Giacomo]], [[Giuseppe Maggiore]], [[Aske Plaat]], [[Renzo Orsini]], [[Pieter Spronck]] ('''2013'''). ''Resources, Entities, Actions. A generalized design pattern for RTS games and its language extension in Casanova''. [[CG 2013]], [http://askeplaat.files.wordpress.com/2013/01/main.pdf pdf]
* [[Jaap van den Herik]], [[Hiroyuki Iida]], [[Aske Plaat]] ('''2013'''). ''The 8th Computers and Games Conference''. [[ICGA Journal#36_3|ICGA Journal, Vol. 36, No. 3]] » [[CG 2013]]
* [[Jaap van den Herik]], [[Hiroyuki Iida]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2013'''). ''The Brain and Mind Sports Olympiad''. [[ICGA Journal#36_3|ICGA Journal, Vol. 36, No. 3]] » [[17th Computer Olympiad]]
* [[Jaap van den Herik]], [[Hiroyuki Iida]], [[Aske Plaat]] ('''2013'''). ''The 8th Computers and Games Conference (Part 2)''. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]] » [[CG 2013]]
* [[Jaap van den Herik]], [[Hiroyuki Iida]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2013'''). ''The Brain and Mind Sports Olympiad (Part 2)''. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]] » [[17th Computer Olympiad]]
* [[Ben Ruijl]], [[Jos Vermaseren]], [[Aske Plaat]], [[Jaap van den Herik]] ('''2013'''). ''Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification''. [http://arxiv.org/abs/1312.0841 CoRR abs/1312.0841]
'''2014'''
* [[Aske Plaat]] ('''2014'''). ''Don Dailey, 1956-2013, an Obituary''. [[ICGA Journal#37_1|ICGA Journal, Vol 37, No. 1]] » [[Don Dailey]]
* [[Ben Ruijl]], [[Jos Vermaseren]], [[Aske Plaat]], [[Jaap van den Herik]] ('''2014'''). ''HEPGAME and the Simplification of Expressions''. [http://arxiv.org/abs/1405.6369 CoRR abs/1405.6369]
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2014'''). ''Performance analysis of a 240 thread tournament level MCTS Go program on the Intel Xeon Phi''. [http://arxiv.org/abs/1409.4297 CoRR abs/1409.4297] » [[Go]], [[Monte-Carlo Tree Search|MCTS]]
* [[Ben Ruijl]], [[Jos Vermaseren]], [[Aske Plaat]], [[Jaap van den Herik]] ('''2014'''). ''Why Local Search Excels in Expression Simplification''. [http://arxiv.org/abs/1409.5223 CoRR abs/1409.5223]
* [[Jaap van den Herik]], [[Aske Plaat]], [[David Levy]], [[Daniel Dimov]] ('''2014'''). ''[http://www.sciencedirect.com/science/article/pii/S1875952114000093 Plagiarism in Game Programming Competitions]''. [http://www.journals.elsevier.com/entertainment-computing/ Entertainment Computing], Vol. 5, No. 3, [http://askeplaat.files.wordpress.com/2013/01/the-application-of-the-icga-rules-v15.pdf pdf preprint]
* [[Jaap van den Herik]], [[Hiroyuki Iida]], [[Aske Plaat]] (eds.) ('''2014'''). ''[http://link.springer.com/book/10.1007/978-3-319-09165-5 Computers and Games: 8th International Conference, CG 2013, Yokohama, Japan, August 13-15, 2013, Revised Selected Papers]''. [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS] 8427, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], ISBN-13: 978-3-319-09164-8 » [[CG 2013]] <ref>[[Dap Hartmann]] ('''2014'''). ''A Statue of unremitting Devotion. Revised Selected papers CG 2013''. (Review) [[ICGA Journal#37_3|ICGA Journal, Vol. 37, No. 3]]</ref>
* [http://dblp.uni-trier.de/pers/hd/a/Absalom:Richard Richard Absalom], [http://scholar.google.com/citations?user=CxVcDicAAAAJ&hl=en Marcus Luczak-Rosch], [[Dap Hartmann]], [[Aske Plaat]] ('''2014'''). ''Crowd-Sourcing Fuzzy and Faceted Classification for Concept Search''. [http://arxiv.org/abs/1406.7749 arXiv:1406.7749], [http://dblp.uni-trier.de/db/journals/corr/corr1406.html#AbsalomLHP14 CoRR, June 2014]
==2015 ...==
* [[Taichi Ishitobi]], [[Aske Plaat]], [[Hiroyuki Iida]], [[Jaap van den Herik]] ('''2015'''). ''Reducing the Seesaw Effect with Deep Proof Number Search''. [[Advances in Computer Games 14]]
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2015'''). ''Scaling Monte Carlo Tree Search on Intel Xeon Phi''. [http://arxiv.org/abs/1507.04383 CoRR abs/1507.04383] » [[Hex]], [[Monte-Carlo Tree Search|MCTS]], [[Parallel Search]], [[x86-64]]
* [[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]
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]] ('''2015'''). ''Ensemble UCT Needs High Exploitation''. [http://arxiv.org/abs/1509.08434 CoRR abs/1509.08434]
* [[Jaap van den Herik]], [[Walter Kosters]], [[Aske Plaat]], [[Johanna Hellemons]] ('''2015'''). ''The 18th Computer Olympiad 2015''. [[ICGA Journal#38_4|ICGA Journal, Vol. 38, No. 4]] » [[18th Computer Olympiad]]
=External Links=
* [http://plaat.nl/ Aske Plaat - homepage]
* [https://www.game-ai-forum.org/icga-tournaments/person.php?id=425 Aske Plaat's ICGA Tournaments]
* [http://people.csail.mit.edu/plaat/resume.html Resume of Aske Plaat]
* [http://www.linkedin.com/in/askeplaat/ Aske Plaat - LinkedIn]
* [http://plaat.nl/mtdf.html Aske Plaat: MTD(f), a new chess algorithm]
=References=
<references />
'''[[People|Up one level]]'''
![border|right|thumb|link=http://plaat.nl/| Aske Plaat <ref>[http://plaat.nl/ plaat.nl]</ref>](/File:AskePlaat.jpg){kind=link}