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). A Framework for Game Tree Algorithms. Report EUR-CS-93-03. Department of Computer Science, Erasmus University, Rotterdam, The Netherlands.
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
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
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 [1].
Table of Contents
Photos
Selected Publications
[4] [5]1990 ...
1995 ...
2000 ...
External Links
References
What links here?
Up one level