25,161
edits
Changes
no edit summary
<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==
==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, 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]
==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 (journal) Artificial 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[[AAAI|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=04E25D5F074D8B5BABB68D2AC5BA5D39?cid10.1.1.77.9111&rep=rep1&type=3161130 pdf pdf] from [httphttps://citeseerx.isten.psuwikipedia.eduorg/viewdocwiki/summary?doi=10.1.1.50.8641 CiteSeerX 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]]
==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]