Difference between revisions of "Aske Plaat"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 16: | Line 16: | ||
<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> | <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== | ==1994== | ||
| − | + | * [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1994, 2014'''). ''Nearly Optimal Minimax Tree Search?'' Technical Report, [[University of Alberta]], [https://arxiv.org/abs/1404.1518 arXiv:1404.1518] | |
| − | * [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1994'''). '' | + | * [[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]] |
| − | * [[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, 2014'''). ''SSS* = Alpha-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'''). '' | + | * [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1994, 2014'''). ''A New Paradigm for Minimax Search''. TR-CS 94-18, [[University of Alberta]], [https://arxiv.org/abs/1404.1515 arXiv:1404.1515] |
| − | * [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1994'''). ''[ | ||
==1995== | ==1995== | ||
| − | * [[Wim Pijls]], [[Arie de Bruin]], [[Aske Plaat]] ('''1995'''). ''Solution Trees as a Basis for Game Tree Search | + | * [[Wim Pijls]], [[Arie de Bruin]], [[Aske Plaat]] ('''1995'''). ''Solution Trees as a Basis for Game Tree Search''. EUR-CS-95-01, [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.'' | + | * [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1995, 2015'''). ''Best-First Fixed Depth Game Tree Search in Practice.'' [[Conferences#IJCAI1995|IJCAI-95]], [https://arxiv.org/abs/1505.01603 arXiv:1505.01603] |
==1996== | ==1996== | ||
| − | * [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1996'''). ''Best-First Fixed-Depth Minimax Algorithms.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_ | + | * [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1996'''). ''Best-First Fixed-Depth Minimax Algorithms.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_(journal) Artificial Intelligence], Vol. 87 |
* [[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. | * [[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.'' | + | * [[Jonathan Schaeffer]], [[Aske Plaat]] ('''1996'''). ''New Advances in Alpha-Beta Searching.'' [[AAAI|AAAI-96]] |
| − | * [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1996'''). ''Exploiting Graph Properties of Game Trees.'' [[AAAI|AAAI-96]], | + | * [[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]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1996'''). ''An Algorithm Faster than NegaScout and SSS* in Practice''. [http://citeseerx.ist.psu.edu/ | + | * [[Aske Plaat]], [[Jonathan Schaeffer]], [[Wim Pijls]], [[Arie de Bruin]] ('''1996, 2017'''). ''A Minimax Algorithm Better Than Alpha-beta?: No and Yes''. [https://arxiv.org/abs/1702.03401 arXiv:1702.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/viewdoc/download?doi=10.1.1.77.9111&rep=rep1&type=pdf pdf] from [https://en.wikipedia.org/wiki/CiteSeerX CiteSeerX] » [[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]] | * [[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 ...== | ==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] | * [[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]] | * [[Jonathan Schaeffer]], [[Aske Plaat]] ('''1997'''). ''Kasparov versus Deep Blue: The Rematch''. [[ICGA Journal#20_2|ICCA Journal, Vol. 20, No. 2]] | ||
| − | + | * [[John Romein]], [[Aske Plaat]], [[Henri Bal]], [[Jonathan Schaeffer]] ('''1999'''). ''Transposition Table Driven Work Scheduling in Distributed Search''. [[AAAI#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> | |
| − | * [[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 ...== | ==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] | * [[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] | ||
Revision as of 23:30, 15 January 2019
Aske Plaat [1]
Aske Plaat,
a Dutch computer scientiest. In 1993 he started as a PhD student at the University of Alberta , and at the Erasmus University Rotterdam. In 1997 he was a postdoc at 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 Vrije Universiteit in Amsterdam where he worked on Wide Area Algorithms. Next, he worked in IT Governance at PriceWaterhouse Coopers, and the 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) [2] search algorithm as applied in Cilkchess [3]. He is deputy editor of the Journal of the International Computer Games Association ICGA.
Contents
See also
Selected Publications
1994
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1994, 2014). Nearly Optimal Minimax Tree Search? Technical Report, University of Alberta, arXiv:1404.1518
- Arie de Bruin, Wim Pijls, Aske Plaat (1994). Solution Trees as a Basis for Game-Tree Search. ICCA Journal, Vol. 17, No. 4
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1994, 2014). SSS* = Alpha-Beta + TT. TR-CS-94-17, University of Alberta, 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, arXiv:1404.1515
1995
- Wim Pijls, Arie de Bruin, Aske Plaat (1995). Solution Trees as a Basis for Game Tree Search. EUR-CS-95-01, Erasmus University, Rotterdam
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1995, 2015). Best-First Fixed Depth Game Tree Search in Practice. IJCAI-95, arXiv:1505.01603
1996
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1996). Best-First Fixed-Depth Minimax Algorithms. Artificial Intelligence, Vol. 87
- Aske Plaat (1996). Research Re: Search & Re-Search. Ph.D. thesis, Erasmus University, Rotterdam, The Netherlands.
- Jonathan Schaeffer, Aske Plaat (1996). New Advances in Alpha-Beta Searching. AAAI-96
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1996). Exploiting Graph Properties of Game Trees. AAAI-96 » Enhanced Transposition Cutoff
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1996, 2017). A Minimax Algorithm Better Than Alpha-beta?: No and Yes. arXiv:1702.03401
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1996). An Algorithm Faster than NegaScout and SSS* in Practice. pdf from CiteSeerX » MTD(f)
- Yngvi Björnsson, Mark Brockington, Andreas Junghanns, Aske Plaat (1996). Report on the Advances in Computer Chess 8 Conference. ICCA Journal, Vol. 19, No. 3 » Advances in Computer Chess 8
1997 ...
- Aske Plaat (1997). MTD(f), A Minimax Algorithm Faster Than NegaScout. Internal Report, Erasmus University Rotterdam
- Jonathan Schaeffer, Aske Plaat (1997). Kasparov versus Deep Blue: The Rematch. ICCA Journal, Vol. 20, No. 2
- John Romein, Aske Plaat, Henri Bal, Jonathan Schaeffer (1999). Transposition Table Driven Work Scheduling in Distributed Search. AAAI-99, pdf [6] [7]
2000 ...
- Jonathan Schaeffer, Aske Plaat, Andreas Junghanns (2001). Unifying Single-agent and Two-player search. Information Sciences, Vol. 135, 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. pdf [8]
2010 ...
- Jaap van den Herik, Aske Plaat, Johanna Hellemons (2010). The JAIST Computer Olympiad. 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, Vol. 33, No. 4
2011
- Jaap van den Herik, Aske Plaat, Johanna Hellemons (2011). The JAIST Computer Olympiad (Part 3). ICGA Journal, Vol. 34, No. 1
- Jaap van den Herik, Aske Plaat, Johanna Hellemons (2011). The JAIST Computer Olympiad (Part 4). ICGA Journal, Vol. 34, No. 2
2012
- Jaap van den Herik, Aske Plaat (2012). The 13th Advances in Computer Games Conference. 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, Vol. 35, No. 1 » 16th Computer Olympiad
- Jaap van den Herik, Aske Plaat, Johanna Hellemons (2012). The 16th Computer Olympiad (part 2). ICGA Journal, Vol. 35, No. 2
- Jaap van den Herik, Aske Plaat, Johanna Hellemons (2012). The 16th Computer Olympiad (part 3). ICGA Journal, Vol. 35, No. 4
- Jan Kuipers, Aske Plaat, Jos Vermaseren, Jaap van den Herik (2012). Improving multivariate Horner schemes with Monte Carlo tree search. 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, pdf
- Jaap van den Herik, Hiroyuki Iida, Aske Plaat (2013). The 8th Computers and Games Conference. 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, 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, 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, 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. CoRR abs/1312.0841
2014
- Aske Plaat (2014). Don Dailey, 1956-2013, an Obituary. 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. 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. CoRR abs/1409.4297 » Go, MCTS
- Ben Ruijl, Jos Vermaseren, Aske Plaat, Jaap van den Herik (2014). Why Local Search Excels in Expression Simplification. CoRR abs/1409.5223
- Jaap van den Herik, Aske Plaat, David Levy, Daniel Dimov (2014). Plagiarism in Game Programming Competitions. Entertainment Computing, Vol. 5, No. 3, pdf preprint
- Jaap van den Herik, Hiroyuki Iida, Aske Plaat (eds.) (2014). Computers and Games: 8th International Conference, CG 2013, Yokohama, Japan, August 13-15, 2013, Revised Selected Papers. LNCS 8427, Springer, ISBN-13: 978-3-319-09164-8 » CG 2013 [9]
- Richard Absalom, Marcus Luczak-Rosch, Dap Hartmann, Aske Plaat (2014). Crowd-Sourcing Fuzzy and Faceted Classification for Concept Search. arXiv:1406.7749, 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. CoRR abs/1507.04383 » Hex, 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. TrustCom/BigDataSE/|ISPA 2015, pdf
- S. Ali Mirsoleimani, Aske Plaat, Jaap van den Herik (2015). Ensemble UCT Needs High Exploitation. CoRR abs/1509.08434
- Jaap van den Herik, Walter Kosters, Aske Plaat, Johanna Hellemons (2015). The 18th Computer Olympiad 2015. ICGA Journal, Vol. 38, No. 4 » 18th Computer Olympiad
External Links
References
- ↑ plaat.nl
- ↑ - A Minimax Algorithm faster than NegaScout
- ↑ Aske Plaat's ICGA Tournaments
- ↑ ICGA Reference Database (pdf)
- ↑ dblp: Aske Plaat
- ↑ Re: scorpio can run on 8192 cores by Daniel Shawul, CCC, August 29, 2015
- ↑ Transposition-driven scheduling - Wikipedia
- ↑ Transposition driven scheduling by Daniel Shawul, CCC, April 04, 2013
- ↑ Dap Hartmann (2014). A Statue of unremitting Devotion. Revised Selected papers CG 2013. (Review) ICGA Journal, Vol. 37, No. 3
