Difference between revisions of "Arie de Bruin"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 5: | Line 5: | ||
'''Arie de Bruin''',<br/> | '''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]. | 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]], | + | Arie de Bruin's 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>, | 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. | 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. | ||
Revision as of 00:27, 17 January 2019
Arie de Bruin [1]
Arie de Bruin,
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, Erasmus University Rotterdam.
Arie de Bruin's research interests covered programming language semantics, game tree search algorithms, and distributed simulation. Along with Wim Pijls, he researched on Stockman's SSS* algorithm,
which they declared "dead" at the 8th Advances in Computer Chess conference 1996 [2],
due to its reformulation as a sequence of depth-first alpha-beta null window calls with transposition table aka MTD(f), as also elaborated along with Aske Plaat and Jonathan Schaeffer in several papers.
Contents
Photos
Kees Sio, Arie de Bruin and Theo van der Storm visiting the WCCC 2002 [3]
Selected Publications
1980 ...
- Jacobus W. de Bakker, Arie de Bruin, Jeffrey Zucker (1980). Mathematical theory of program correctness. Prentice Hall
- Arie de Bruin (1981). Goto Statements: Semantics and Deduction Systems. Acta Informatica, Vol. 15
- Arie de Bruin (1984). On the Existence of Cook Semantics. SIAM Journal on Computing, Vol. 13, No. 1 » Stephen Cook
1985 ...
- Arie de Bruin, A. P. Wim Böhm (1985). The Denotational Semantics of Dynamic Networks of Processes. 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, Vrije Universiteit Amsterdam
- Arie de Bruin, Erik P. de Vink (1989). Continuation Semantics for PROLOG with Cut. 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, Erasmus University, Rotterdam
- Wim Pijls, Arie de Bruin (1993). SSS*-like Algorithms in Constrained Memory. ICCA Journal, Vol. 16, No. 1
- Wim Pijls, Arie de Bruin (1993). A Framework for Game Tree Algorithms. EUR-CS-93-03. 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, arXiv:1404.1518
- Arie de Bruin, Wim Pijls, Aske Plaat (1994). Solution Trees as a Basis for Game-Tree Search. 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, 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, 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, Erasmus University, Rotterdam
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1995, 2015). Best-First Fixed Depth Game Tree Search in Practice. IJCAI-95, arXiv:1505.01603
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1996). Best-First Fixed-Depth Minimax Algorithms. Artificial Intelligence, Vol. 87
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1996). Exploiting Graph Properties of Game Trees. 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. arXiv:1702.03401
- Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (1996). An Algorithm Faster than NegaScout and SSS* in Practice. pdf from CiteSeerX » MTD(f)
- Arie de Bruin, Wim Pijls (1997). SSS†. Advances in Computer Chess 8
- Wim Pijls, Arie de Bruin (1998). Game Tree Algorithms and Solution Trees. CG 1998
2000 ...
- Wim Pijls, Arie de Bruin (2001). Game tree algorithms and solution trees. Erasmus University Rotterdam, pdf
- S.C. van der Made-Potuijt, Arie de Bruin (2002). An Introduction to Paradigm. ERS-2002-09-LIS, Erasmus Research Institute of Management (ERIM)
- Arie de Bruin, Wim Pijls (2003). Trends in game tree search. Erasmus University, Rotterdam
2005 ...
- Katalin Boer-Sorban, Arie de Bruin, Uzay Kaymak (2005). On the Design of Artificial Stock Markets. ERS-2005-001-LIS, Erasmus Research Institute of Management (ERIM)
- Katalin Boer-Sorban, Uzay Kaymak, Arie de Bruin (2005). A Modular Agent-Based Environment for Studying Stock Markets. ERS-2005-017-LIS, Erasmus Research Institute of Management (ERIM)
- Csaba Attila Boer, Arie de Bruin, Alexander Verbraeck (2009). A survey on distributed simulation in industry. Journal of Simulation, Vol. 3, No. 10 [7]
External Links
- RePub, Erasmus University Repository: A. de Bruin (Arie)
- Arie de Bruin - The Mathematics Genealogy Project
- Arie de Bruin - Google Scholar Citations
- Arie de Bruin - Semantic Scholar
References
- ↑ Image from Arie de Bruin's former homepage
- ↑ Arie de Bruin, Wim Pijls (1997). SSS†. Advances in Computer Chess 8
- ↑ 10e WK Computerschaak, 6-11 juli 2002, Maastricht, CSVN site
- ↑ ICGA Reference Database (pdf)
- ↑ dblp: Arie de Bruin
- ↑ RePub, Erasmus University Repository: A. de Bruin (Arie)
- ↑ Csaba Attila Boer (2005). Distributed Simulation in Industry. Ph.D. thesis, Erasmus University Rotterdam, Promotor Arie de Bruin
