Arie+de+Bruin

a Dutch computer scientist and professor at the Department of Computer Science, Faculty of Economics, [|Erasmus University Rotterdam]. Arie de Bruin research interests cover various search algorithms, especially with Wim Pijls the investigation on Stockman's SSS* algorithm, which they declared "dead" at the 8th Advances in Computer Chess conference 1996. || toc =Photos= =Selected Publications=
 * Home * People * Arie de Bruin**
 * [[image:adebruin.JPG link="http://people.few.eur.nl/adebruin/"]] ||~  || **Arie de Bruin**,
 * Arie de Bruin ||~   ||^  ||
 * [[image:Sio-en-vanderStorm.jpg link="http://old.csvn.nl/wk2002.html"]] ||
 * Kees Sio, Arie de Bruin and Theo van der Storm, WCCC 2002 ||

1990 ...

 * Wim Pijls, Arie de Bruin (**1990**). //Another View on the SSS* Algorithm.// International Symposium SIGAL '90 (eds. T. Asano, T. Ibaraki, H. Imai, and T. Nishizeki), pp. 211-220. Tokyo, Japan. Lecture Notes in Computer Science, Vol. 450, Springer-Verlag, New York, NY. ISSN 0302-9743.
 * Wim Pijls, Arie de Bruin (**1992**). //Searching Informed Game Trees.// Report EUR-CS-92-02, Department of Computer Science, Erasmus University Rotterdam. An extended abstract in Proceedings CSN 92, pp. 246-256, and Algorithms and Computation, Proceedings of the Third International Symposium ISAAC 92 (eds. T. Ibaraki, Y. Inagaki, K. Iwama, T. Nishizeki and M. Yamashita), pp. 332-341, Nagoya 1992, published in Lecture Notes in Computer Science, Vol. 650.
 * 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. Report EUR-CS-93-03. Department of Computer Science, Erasmus University, Rotterdam, The Netherlands.
 * Wim Pijls, Arie de Bruin (**1994**). Generalizing Alpha-Beta. Advances in Computer Chess 7
 * Arie de Bruin, Wim Pijls, Aske Plaat (**1994**). //Solution Trees as a Basis for Game Tree Search.// Technical Report EUR-CS-94-04, Department of Computer Science, Erasmus University Rotterdam. [|pdf]
 * Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (**1994**). //[|Nearly Optimal Minimax Tree Search?]// Technical Report, University of Alberta
 * 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**). //[|SSS* = a-b TT]//. TR-CS-94-17, University of Alberta
 * Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (**1994**). //[|A New Paradigm for Minimax Search]//. TR 94-18

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, Erasmus University Rotterdam, Rotterdam, The Netherlands.
 * Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (**1995**). //Best-First Fixed Depth Game Tree Search in Practice.// Proceedings of International Joint Conference on Artificial Intelligence (IJCAI-95), Vol. 1, pp. 273-279. Montreal, Quebec, Canada. [|ps]
 * Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (**1996**). //Best-First Fixed-Depth Minimax Algorithms.// Artificial Intelligence, Vol. 87, Nos. 1-2, pp. 255-293. ISSN 0004-3702, [|pdf]
 * Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (**1996**). //Exploiting Graph Properties of Game Trees.// [|13th National Conference on Artificial Intelligence] ([|AAAI-96]), Vol. 1, pp. 234-239, ISBN 978-0-262-51091-2. [|pdf], [|ps], see Enhanced Transposition Cutoff
 * Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin (**1996**). //An Algorithm Faster than NegaScout and SSS* in Practice//, [|pdf] from [|CiteSeerX], covers 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
 * Aske Plaat, Arie de Bruin, Jonathan Schaeffer, Wim Pijls (**1999**). //A Minimax Algorithm better than SSS*.// Artificial Intelligence, Vol. 87, pp. 255–293. ISSN 0004-3702.

2000 ...

 * Wim Pijls, Arie de Bruin (**2001**). //Game tree algorithms and solution trees//. Department of Computer Science, [|Erasmus University], Rotterdam, The Netherlands, [|pdf]

=External Links=
 * [|Welcome to the homepage of Arie de Bruin]

=References= =What links here?= include page="Arie de Bruin" component="backlinks" limit="60"
 * Up one level**