25,161
edits
Changes
Created page with "'''Home * People * Arie de Bruin''' border|right|thumb| Arie de Bruin <ref>Image from of Arie de Bruin's former homepage</ref> '''A..."
'''[[Main Page|Home]] * [[People]] * Arie de Bruin'''
[[FILE:adebruin.JPG|border|right|thumb| Arie de Bruin <ref>Image from of Arie de Bruin's former homepage</ref> ]]
'''Arie de Bruin''',<br/>
a Dutch computer scientist and retired researcher, most recently affiliated with the [[Delft University of Technology]], until 2006 professor at the Department of Computer Science, Faculty of Economics, [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University Rotterdam].
Arie de Bruin research interests covered [https://en.wikipedia.org/wiki/Semantics_(computer_science) programming language semantics], game tree [[Search|search]] algorithms, and [https://en.wikipedia.org/wiki/Distributed_Interactive_Simulation distributed simulation]. Along with [[Wim Pijls]], he researched 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.
=Photos=
[[FILE:Sio-en-vanderStorm.jpg|none|border|text-bottom|640px|link=http://old.csvn.nl/wk2002.html]]
[[Kees Sio]], [[Arie de Bruin]] and [[Theo van der Storm]] visiting the [[WCCC 2002]] <ref>[http://old.csvn.nl/wk2002.html 10e WK Computerschaak, 6-11 juli 2002, Maastricht], [[CSVN]] site</ref>
=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/b/Bruin:Arie_de.html dblp: Arie de Bruin]</ref>
==1980 ...==
* [[Mathematician#JWdBakker|Jacobus W. de Bakker]], [[Arie de Bruin]], [[Mathematician#JZucker|Jeffrey Zucker]] ('''1980'''). ''[https://www.semanticscholar.org/paper/Mathematical-theory-of-program-correctness-Bakker-Bruin/6e4a2a3c5464ac544468c77c3a07ec585c06c7ac Mathematical theory of program correctness]''. [https://en.wikipedia.org/wiki/Prentice_Hall Prentice Hall]
* [[Arie de Bruin]] ('''1981'''). ''Goto Statements: Semantics and Deduction Systems''. [https://en.wikipedia.org/wiki/Acta_Informatica Acta Informatica], Vol. 15
* [[Arie de Bruin]] ('''1981'''). ''[https://www.researchgate.net/publication/220616549_On_the_Existence_of_Cook_Semantics On the Existence of Cook Semantics]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 13, No. 1 » [[Mathematician#SCook|Stephen Cook]]
==1985 ...==
* [[Arie de Bruin]], [[Mathematician#APWBohm|A. P. Wim Böhm]] ('''1985'''). ''The Denotational Semantics of Dynamic Networks of Processes''. [[ACM#TOPLAS|ACM Transactions on Programming Languages and Systems], Vol. 7, No. 4
* [[Arie de Bruin]] ('''1986'''). ''Experiments with Continuation Semantics: Jumps, Backtracking, Dynamic Networks''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Vrije_Universiteit_Amsterdam Vrije Universiteit Amsterdam]
* [[Arie de Bruin]], [[Mathematician#EPdeVink|Erik P. de Vink]] ('''1989'''). ''Continuation Semantics for PROLOG with Cut''. [https://dblp.uni-trier.de/db/conf/tapsoft/tapsoft89-1.html TAPSOFT], Vol. 1
==1990 ...==
* [[Wim Pijls]], [[Arie de Bruin]] ('''1990'''). ''Another View on the SSS* Algorithm''. International Symposium SIGAL '90
* [[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]
* [[Mathematician#CABoer|Csaba Attila Boer]], [[Arie de Bruin]], [https://scholar.google.com/citations?user=5WTq7iUAAAAJ&hl=en Alexander Verbraeck] ('''2009'''). ''[https://www.tandfonline.com/doi/abs/10.1057/jos.2008.9?journalCode=tjsm20 A survey on distributed simulation in industry]''. [https://en.wikipedia.org/wiki/Journal_of_Simulation Journal of Simulation], Vol. 3, No. 10
=External Links=
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=75781 Arie de Bruin - The Mathematics Genealogy Project]
* [https://scholar.google.com/citations?user=TR9NaBkAAAAJ&hl=en Arie de Bruin - Google Scholar Citations]
* [https://www.semanticscholar.org/author/Arie-de-Bruin/2055757 Arie de Bruin - Semantic Scholar]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Bruin]]
[[Category:Researcher|Bruin]]
[[FILE:adebruin.JPG|border|right|thumb| Arie de Bruin <ref>Image from of Arie de Bruin's former homepage</ref> ]]
'''Arie de Bruin''',<br/>
a Dutch computer scientist and retired researcher, most recently affiliated with the [[Delft University of Technology]], until 2006 professor at the Department of Computer Science, Faculty of Economics, [https://en.wikipedia.org/wiki/Erasmus_University_Rotterdam Erasmus University Rotterdam].
Arie de Bruin research interests covered [https://en.wikipedia.org/wiki/Semantics_(computer_science) programming language semantics], game tree [[Search|search]] algorithms, and [https://en.wikipedia.org/wiki/Distributed_Interactive_Simulation distributed simulation]. Along with [[Wim Pijls]], he researched 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.
=Photos=
[[FILE:Sio-en-vanderStorm.jpg|none|border|text-bottom|640px|link=http://old.csvn.nl/wk2002.html]]
[[Kees Sio]], [[Arie de Bruin]] and [[Theo van der Storm]] visiting the [[WCCC 2002]] <ref>[http://old.csvn.nl/wk2002.html 10e WK Computerschaak, 6-11 juli 2002, Maastricht], [[CSVN]] site</ref>
=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/b/Bruin:Arie_de.html dblp: Arie de Bruin]</ref>
==1980 ...==
* [[Mathematician#JWdBakker|Jacobus W. de Bakker]], [[Arie de Bruin]], [[Mathematician#JZucker|Jeffrey Zucker]] ('''1980'''). ''[https://www.semanticscholar.org/paper/Mathematical-theory-of-program-correctness-Bakker-Bruin/6e4a2a3c5464ac544468c77c3a07ec585c06c7ac Mathematical theory of program correctness]''. [https://en.wikipedia.org/wiki/Prentice_Hall Prentice Hall]
* [[Arie de Bruin]] ('''1981'''). ''Goto Statements: Semantics and Deduction Systems''. [https://en.wikipedia.org/wiki/Acta_Informatica Acta Informatica], Vol. 15
* [[Arie de Bruin]] ('''1981'''). ''[https://www.researchgate.net/publication/220616549_On_the_Existence_of_Cook_Semantics On the Existence of Cook Semantics]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 13, No. 1 » [[Mathematician#SCook|Stephen Cook]]
==1985 ...==
* [[Arie de Bruin]], [[Mathematician#APWBohm|A. P. Wim Böhm]] ('''1985'''). ''The Denotational Semantics of Dynamic Networks of Processes''. [[ACM#TOPLAS|ACM Transactions on Programming Languages and Systems], Vol. 7, No. 4
* [[Arie de Bruin]] ('''1986'''). ''Experiments with Continuation Semantics: Jumps, Backtracking, Dynamic Networks''. Ph.D. thesis, [https://en.wikipedia.org/wiki/Vrije_Universiteit_Amsterdam Vrije Universiteit Amsterdam]
* [[Arie de Bruin]], [[Mathematician#EPdeVink|Erik P. de Vink]] ('''1989'''). ''Continuation Semantics for PROLOG with Cut''. [https://dblp.uni-trier.de/db/conf/tapsoft/tapsoft89-1.html TAPSOFT], Vol. 1
==1990 ...==
* [[Wim Pijls]], [[Arie de Bruin]] ('''1990'''). ''Another View on the SSS* Algorithm''. International Symposium SIGAL '90
* [[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]
* [[Mathematician#CABoer|Csaba Attila Boer]], [[Arie de Bruin]], [https://scholar.google.com/citations?user=5WTq7iUAAAAJ&hl=en Alexander Verbraeck] ('''2009'''). ''[https://www.tandfonline.com/doi/abs/10.1057/jos.2008.9?journalCode=tjsm20 A survey on distributed simulation in industry]''. [https://en.wikipedia.org/wiki/Journal_of_Simulation Journal of Simulation], Vol. 3, No. 10
=External Links=
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=75781 Arie de Bruin - The Mathematics Genealogy Project]
* [https://scholar.google.com/citations?user=TR9NaBkAAAAJ&hl=en Arie de Bruin - Google Scholar Citations]
* [https://www.semanticscholar.org/author/Arie-de-Bruin/2055757 Arie de Bruin - Semantic Scholar]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Mathematician|Bruin]]
[[Category:Researcher|Bruin]]
