25,161
edits
Changes
no edit summary
'''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 '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>,
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.
