Difference between revisions of "Aske Plaat"

From Chessprogramming wiki
Jump to: navigation, search
Line 32: Line 32:
 
* [[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]]
 
* [[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''. [[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>

Revision as of 12:21, 17 January 2019

Home * People * Aske Plaat

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.

See also

Selected Publications

[4] [5]

1994

1995

1996

1997 ...

2000 ...

2010 ...

2011

2012

2013

2014

2015 ...

External Links

References

Up one level