Difference between revisions of "Aske Plaat"

From Chessprogramming wiki
Jump to: navigation, search
 
(12 intermediate revisions by the same user not shown)
Line 4: Line 4:
  
 
'''Aske Plaat''',<br/>
 
'''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>[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]].  
+
a Dutch computer scientiest and professor and scientific director of the Leiden institute for artificial intelligence and computer science (LIACS), [[Leiden University]]. 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 University Rotterdam] where he obtained his Ph.D. in 1996. As postdoc at [[Massachusetts Institute of Technology|MIT]], he worked with [[Charles Leiserson]] and [[Don Dailey]] on [[Cilkchess]]. 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 [https://en.wikipedia.org/wiki/Distributed_algorithm distributed algorithms]. Next, 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], The Netherlands. Since October 2009, he is professor of information and complex decision making at [[Tilburg University]], since 2014 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]].  
  
 
=See also=  
 
=See also=  
Line 14: Line 16:
  
 
=Selected Publications=  
 
=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>
+
<ref>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/p/Plaat:Aske dblp: Aske Plaat]</ref>
 
==1994==  
 
==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, 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'''). ''[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'''). ''[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'''). ''[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, 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'''). ''[http://arxiv.org/abs/1404.1515?context=cs.AI A New Paradigm for Minimax Search]''. TR 94-18
 
 
==1995==  
 
==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]
+
* [[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.'' 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]
+
* [[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_%28journal%29Artificial Intelligence], Vol. 87, Nos. 1-2, [http://www.ldc.usb.ve/~bonet/courses/ci5437/papers/mtd.pdf pdf]
+
* [[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.'' 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]
+
* [[Jonathan Schaeffer]], [[Aske Plaat]] ('''1996'''). ''New Advances in Alpha-Beta Searching.'' [[Conferences#AAAI-96|AAAI-96]]
−
* [[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'''). ''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/showciting;jsessionid=04E25D5F074D8B5BABB68D2AC5BA5D39?cid=3161130 pdf] from [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.8641 CiteSeerX], covers [[MTD(f)]]
+
* [[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, 2014'''). ''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]
 
* [[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]]
−
* [[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>
−
* [[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]
Line 69: Line 70:
 
* [[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]]  
 
* [[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'''). ''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]], [[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]
 
* [[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]]
 
* [[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]]
 +
'''2016'''
 +
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2016'''). ''A New Method for Parallel Monte Carlo Tree Search''. [https://arxiv.org/abs/1605.04447 arXiv:1605.04447]  » [[Monte-Carlo Tree Search|MCTS]], [[Parallel Search]]
 +
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2016'''). ''An Efficient Computation Pattern for Parallel MCTS''. [http://www.ictopen.nl/content/Previous+editions ICT.OPEN 2016], [http://liacs.leidenuniv.nl/~plaata1/papers/ictopen2016.pdf pdf]
 +
'''2017'''
 +
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2017'''). ''Structured Parallel Programming for Monte Carlo Tree Search''. [https://arxiv.org/abs/1704.00325 arXiv:1704.00325]
 +
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2017'''). ''An Analysis of Virtual Loss in Parallel MCTS''. [https://dblp.uni-trier.de/db/conf/icaart/icaart2017-2.html ICAART 2017], Vol. 2, [http://liacs.leidenuniv.nl/~plaata1/papers/paper_ICAART17.pdf pdf]
 +
'''2018'''
 +
* [[Hui Wang]], [[Michael Emmerich]], [[Aske Plaat]] ('''2018'''). ''Monte Carlo Q-learning for General Game Playing''. [https://arxiv.org/abs/1802.05944 arXiv:1802.05944] » [[Monte-Carlo Tree Search|MCTS]], [[Reinforcement Learning]], [[General Game Playing]]
 +
* [[Hui Wang]], [[Michael Emmerich]], [[Aske Plaat]] ('''2018'''). ''Assessing the Potential of Classical Q-learning in General Game Playing''. [https://arxiv.org/abs/1810.06078 arXiv:1810.06078]
 +
* [[S. Ali Mirsoleimani]], [[Jaap van den Herik]], [[Aske Plaat]], [[Jos Vermaseren]] ('''2018'''). ''Pipeline Pattern for Parallel MCTS''. [https://dblp.uni-trier.de/db/conf/icaart/icaart2018-2.html ICAART 2018], [http://liacs.leidenuniv.nl/~plaata1/papers/paper_ICAART18_pos.pdf pdf]
 +
* [[S. Ali Mirsoleimani]], [[Jaap van den Herik]], [[Aske Plaat]], [[Jos Vermaseren]] ('''2018'''). ''A Lock-free Algorithm for Parallel MCTS''. [https://dblp.uni-trier.de/db/conf/icaart/icaart2018-2.html ICAART 2018], [http://liacs.leidenuniv.nl/~plaata1/papers/paper_ICAART18.pdf pdf]
  
 
=External Links=  
 
=External Links=  
Line 83: Line 95:
  
 
'''[[People|Up one level]]'''
 
'''[[People|Up one level]]'''
 +
[[Category:Chess Programmer|Plaat]]
 +
[[Category:Researcher|Plaat]]

Latest revision as of 17:22, 16 November 2020

Home * People * Aske Plaat

Aske Plaat [1]

Aske Plaat,
a Dutch computer scientiest and professor and scientific director of the Leiden institute for artificial intelligence and computer science (LIACS), Leiden University. He studied artificial intelligence under the guidance of Jonathan Schaeffer at the University of Alberta, and Arie de Bruin and Wim Pijls at the Erasmus University Rotterdam where he obtained his Ph.D. in 1996. As postdoc at MIT, he worked with Charles Leiserson and Don Dailey on Cilkchess. Until 1999, he was researcher in the Computer Systems Group of the Vrije Universiteit in Amsterdam, where he worked with Henri Bal on distributed algorithms. Next, Aske Plaat worked in IT Governance at PriceWaterhouse Coopers, and the Ministry of Justice, The Netherlands. Since October 2009, he is professor of information and complex decision making at Tilburg University, since 2014 affiliated with 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.

See also

Selected Publications

[4] [5]

1994

1995

1996

1997 ...

2000 ...

2010 ...

2011

2012

2013

2014

2015 ...

2016

2017

2018

External Links

References

  1. ↑ plaat.nl
  2. ↑ - A Minimax Algorithm faster than NegaScout
  3. ↑ Aske Plaat's ICGA Tournaments
  4. ↑ ICGA Reference Database
  5. ↑ dblp: Aske Plaat
  6. ↑ Re: scorpio can run on 8192 cores by Daniel Shawul, CCC, August 29, 2015
  7. ↑ Transposition-driven scheduling - Wikipedia
  8. ↑ Transposition driven scheduling by Daniel Shawul, CCC, April 04, 2013
  9. ↑ Dap Hartmann (2014). A Statue of unremitting Devotion. Revised Selected papers CG 2013. (Review) ICGA Journal, Vol. 37, No. 3

Up one level

Retrieved from "https://www.chessprogramming.org/index.php?title=Aske_Plaat&oldid=22336"