25,161
edits
Changes
Created page with "'''Home * People * Wim Pijls''' FILE:WimPijls.jpg|border|right|thumb|link=https://www.erim.eur.nl/business-intelligence/news/detail/1994-profdrir-uzay-kay..."
'''[[Main Page|Home]] * [[People]] * Wim Pijls'''
[[FILE:WimPijls.jpg|border|right|thumb|link=https://www.erim.eur.nl/business-intelligence/news/detail/1994-profdrir-uzay-kaymak-and-dr-wim-pijls-leave-econometric-institute/| Wim Pijls <ref>[https://www.erim.eur.nl/business-intelligence/news/detail/1994-profdrir-uzay-kaymak-and-dr-wim-pijls-leave-econometric-institute/ Prof.dr.ir. Uzay Kaymak and Dr. Wim Pijls Leave Econometric Institute - News - Business Intelligence - Erasmus Research Institute of Management - ERIM], September 01, 2011</ref> ]]
'''Wim Pijls''',<br/>
a Dutch computer scientist and professor at the Department of Computer Science, Faculty of Economics, [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University Rotterdam], since 2011 retired <ref>[https://www.erim.eur.nl/business-intelligence/news/detail/1994-profdrir-uzay-kaymak-and-dr-wim-pijls-leave-econometric-institute/ Prof.dr.ir. Uzay Kaymak and Dr. Wim Pijls Leave Econometric Institute - News - Business Intelligence - Erasmus Research Institute of Management - ERIM], September 01, 2011</ref>.
He researched on various game tree [[Search|search]] algorithms, in particular along with [[Arie de Bruin]] on [[George Stockman|Stockman's]] [[SSS* and Dual*|SSS* algorithm]],
which they declared "dead" at the [[Advances in Computer Chess 8|8th Advances in Computer Chess]] conference 1996 <ref>[[Arie de Bruin]], [[Wim Pijls]] ('''1997'''). ''SSS†.'' [[Advances in Computer Chess 8]]</ref>,
due to its reformulation as a sequence of [[Depth-First|depth-first]] [[Alpha-Beta|alpha-beta]] [[Null Window|null window]] calls with [[Transposition Table|transposition table]] aka [[MTD(f)]], as also elaborated along with [[Aske Plaat]] and [[Jonathan Schaeffer]] in several papers.
=Selected Publications=
<ref>[https://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[https://dblp.uni-trier.de/pers/hd/p/Pijls:Wim.html dblp: Wim Pijls]</ref>
==1990 ...==
* [[Wim Pijls]], [[Arie de Bruin]] ('''1990'''). ''Another View on the SSS* Algorithm''. International Symposium SIGAL '90
* [[Wim Pijls]] ('''1991'''). ''Shortest paths and game trees.'' Ph.D. thesis, [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University, Rotterdam]
* [[Wim Pijls]], [[Arie de Bruin]] ('''1992'''). ''Searching Informed Game Trees.'' EUR-CS-92-02, [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University, Rotterdam]
* [[Wim Pijls]], [[Arie de Bruin]] ('''1993'''). ''SSS*-like Algorithms in Constrained Memory.'' [[ICGA Journal#16_1|ICCA Journal, Vol. 16, No. 1]]
* [[Wim Pijls]], [[Arie de Bruin]] ('''1993'''). ''A Framework for Game Tree Algorithms''. EUR-CS-93-03. [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University, Rotterdam]
* [[Wim Pijls]], [[Arie de Bruin]] ('''1994'''). ''Generalizing Alpha-Beta''. [[Advances in Computer Chess 7]]
* [[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]
* [[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]]
* [[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, 2014'''). ''A New Paradigm for Minimax Search''. TR-CS 94-18, [[University of Alberta]], [https://arxiv.org/abs/1404.1515 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, [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.'' [[Conferences#IJCAI1995|IJCAI-95]], [https://arxiv.org/abs/1505.01603 arXiv:1505.01603]
* [[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]], [[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, 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)]]
* [[Arie de Bruin]], [[Wim Pijls]] ('''1997'''). ''SSS†.'' [[Advances in Computer Chess 8]]
* [[Wim Pijls]], [[Arie de Bruin]] ('''1998'''). ''[https://link.springer.com/chapter/10.1007/3-540-48957-6_12 Game Tree Algorithms and Solution Trees]''. [[CG 1998]]
==2000 ...==
* [[Wim Pijls]], [[Arie de Bruin]] ('''2001'''). ''Game tree algorithms and solution trees''. [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University Rotterdam], [http://publishing.eur.nl/ir/repub/asset/763/eur-few-cs-98-02.pdf pdf]
* [[Walter Kosters]], [[Wim Pijls]] ('''2003'''). ''APRIORI, A Depth First Implementation''. FIMI 2003, [http://ceur-ws.org/Vol-90/kosters.pdf pdf]
* [[Wim Pijls]], [https://dblp.uni-trier.de/pers/hd/p/Post:Henk Henk Post] ('''2009'''). ''A new bidirectional search algorithm with shortened postprocessing''. [https://en.wikipedia.org/wiki/European_Journal_of_Operational_Research European Journal of Operational Research], Vol. 198, No. 2
=External Links=
* [https://www.genealogy.math.ndsu.nodak.edu/id.php?id=75828 Wim Pijls - The Mathematics Genealogy Project]
* [https://www.erim.eur.nl/business-intelligence/news/detail/1994-profdrir-uzay-kaymak-and-dr-wim-pijls-leave-econometric-institute/ Prof.dr.ir. Uzay Kaymak and Dr. Wim Pijls Leave Econometric Institute - News - Business Intelligence - Erasmus Research Institute of Management - ERIM], September 01, 2011
* [https://www.semanticscholar.org/author/Wim-Pijls/2653209 Wim Pijls - Semantic Scholar]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Pijls]]
[[Category:Researcher|Pijls]]
[[FILE:WimPijls.jpg|border|right|thumb|link=https://www.erim.eur.nl/business-intelligence/news/detail/1994-profdrir-uzay-kaymak-and-dr-wim-pijls-leave-econometric-institute/| Wim Pijls <ref>[https://www.erim.eur.nl/business-intelligence/news/detail/1994-profdrir-uzay-kaymak-and-dr-wim-pijls-leave-econometric-institute/ Prof.dr.ir. Uzay Kaymak and Dr. Wim Pijls Leave Econometric Institute - News - Business Intelligence - Erasmus Research Institute of Management - ERIM], September 01, 2011</ref> ]]
'''Wim Pijls''',<br/>
a Dutch computer scientist and professor at the Department of Computer Science, Faculty of Economics, [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University Rotterdam], since 2011 retired <ref>[https://www.erim.eur.nl/business-intelligence/news/detail/1994-profdrir-uzay-kaymak-and-dr-wim-pijls-leave-econometric-institute/ Prof.dr.ir. Uzay Kaymak and Dr. Wim Pijls Leave Econometric Institute - News - Business Intelligence - Erasmus Research Institute of Management - ERIM], September 01, 2011</ref>.
He researched on various game tree [[Search|search]] algorithms, in particular along with [[Arie de Bruin]] on [[George Stockman|Stockman's]] [[SSS* and Dual*|SSS* algorithm]],
which they declared "dead" at the [[Advances in Computer Chess 8|8th Advances in Computer Chess]] conference 1996 <ref>[[Arie de Bruin]], [[Wim Pijls]] ('''1997'''). ''SSS†.'' [[Advances in Computer Chess 8]]</ref>,
due to its reformulation as a sequence of [[Depth-First|depth-first]] [[Alpha-Beta|alpha-beta]] [[Null Window|null window]] calls with [[Transposition Table|transposition table]] aka [[MTD(f)]], as also elaborated along with [[Aske Plaat]] and [[Jonathan Schaeffer]] in several papers.
=Selected Publications=
<ref>[https://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref> <ref>[https://dblp.uni-trier.de/pers/hd/p/Pijls:Wim.html dblp: Wim Pijls]</ref>
==1990 ...==
* [[Wim Pijls]], [[Arie de Bruin]] ('''1990'''). ''Another View on the SSS* Algorithm''. International Symposium SIGAL '90
* [[Wim Pijls]] ('''1991'''). ''Shortest paths and game trees.'' Ph.D. thesis, [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University, Rotterdam]
* [[Wim Pijls]], [[Arie de Bruin]] ('''1992'''). ''Searching Informed Game Trees.'' EUR-CS-92-02, [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University, Rotterdam]
* [[Wim Pijls]], [[Arie de Bruin]] ('''1993'''). ''SSS*-like Algorithms in Constrained Memory.'' [[ICGA Journal#16_1|ICCA Journal, Vol. 16, No. 1]]
* [[Wim Pijls]], [[Arie de Bruin]] ('''1993'''). ''A Framework for Game Tree Algorithms''. EUR-CS-93-03. [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University, Rotterdam]
* [[Wim Pijls]], [[Arie de Bruin]] ('''1994'''). ''Generalizing Alpha-Beta''. [[Advances in Computer Chess 7]]
* [[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]
* [[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]]
* [[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, 2014'''). ''A New Paradigm for Minimax Search''. TR-CS 94-18, [[University of Alberta]], [https://arxiv.org/abs/1404.1515 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, [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.'' [[Conferences#IJCAI1995|IJCAI-95]], [https://arxiv.org/abs/1505.01603 arXiv:1505.01603]
* [[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]], [[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, 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)]]
* [[Arie de Bruin]], [[Wim Pijls]] ('''1997'''). ''SSS†.'' [[Advances in Computer Chess 8]]
* [[Wim Pijls]], [[Arie de Bruin]] ('''1998'''). ''[https://link.springer.com/chapter/10.1007/3-540-48957-6_12 Game Tree Algorithms and Solution Trees]''. [[CG 1998]]
==2000 ...==
* [[Wim Pijls]], [[Arie de Bruin]] ('''2001'''). ''Game tree algorithms and solution trees''. [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University Rotterdam], [http://publishing.eur.nl/ir/repub/asset/763/eur-few-cs-98-02.pdf pdf]
* [[Walter Kosters]], [[Wim Pijls]] ('''2003'''). ''APRIORI, A Depth First Implementation''. FIMI 2003, [http://ceur-ws.org/Vol-90/kosters.pdf pdf]
* [[Wim Pijls]], [https://dblp.uni-trier.de/pers/hd/p/Post:Henk Henk Post] ('''2009'''). ''A new bidirectional search algorithm with shortened postprocessing''. [https://en.wikipedia.org/wiki/European_Journal_of_Operational_Research European Journal of Operational Research], Vol. 198, No. 2
=External Links=
* [https://www.genealogy.math.ndsu.nodak.edu/id.php?id=75828 Wim Pijls - The Mathematics Genealogy Project]
* [https://www.erim.eur.nl/business-intelligence/news/detail/1994-profdrir-uzay-kaymak-and-dr-wim-pijls-leave-econometric-institute/ Prof.dr.ir. Uzay Kaymak and Dr. Wim Pijls Leave Econometric Institute - News - Business Intelligence - Erasmus Research Institute of Management - ERIM], September 01, 2011
* [https://www.semanticscholar.org/author/Wim-Pijls/2653209 Wim Pijls - Semantic Scholar]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Pijls]]
[[Category:Researcher|Pijls]]
