Alexander Reinefeld

From Chessprogramming wiki
Jump to: navigation, search

Home * People * Alexander Reinefeld

Alexander Reinefeld [1]

Alexander Reinefeld,
a German computer scientist, games researcher, and professor of Computer Science at the Zuse Institute Berlin (ZIB). He studied physics at the Technical University of Braunschweig and computer science at the University of Hamburg and during two one-year visits in Edmonton, at the University of Alberta. In 1982, he concluded his graduate in computer science and in 1987 he received his Ph.D at the University of Hamburg. From 1983 to 1987, he worked as a scientific employee, and from 1989 to 1992 as assistant at the University of Hamburg. During the years 1987 to 1990 he collected industrial experience as a management consultant in the areas of Systems analysis, Databases and Compiler building. In 1992 Reinefeld collaborated with the Paderborn Center for Parallel Computing (PC²) at the Paderborn University [2]. Since 1998, Alexander Reinefeld leads the area of Computer Science in the Zuse Institute Berlin (ZIB). He is a member of the Gesellschaft für Informatik, the ACM, the IEEE Computer Society, the German university association Deutscher Hochschulverband (DHV) and Chair of Parallel and Distributed Systems at the Humboldt University of Berlin.

Chess Programs


In 1979 at the University of Hamburg, motivated and supported by his advisor Frieder Schwenkel, Alexander Reinefeld designed the chess program Murks, partly implemented in microcode for an Interdata M85 minicomputer.

Reinefeld: world chess champion Mikhail Botvinnik visited us and played against Murks. 


In 1980/81, a team of four students, Manfred Allers, Dirk Hauschildt, Dieter Steinwender and Alexander Reinefeld, ported Murks to a Motorola MC68000 Microprocessor, then dubbed MicroMurks. They built their own MC68000 microcomputer from scratch [3] Micromurks II represented by Dieter Steinwender, participated at the WMCCC 1983 in Budapest.

Search Algorithms


In 1983 Alexander Reinefeld introduced the NegaScout search-algorithm, an improvement of Judea Pearl's Scout [4] .

RecSSS* and RecDual*

Ten years later, in 1993 at the 7th Advances in Computer Chess conference, Reinefeld made an attempt to resuscitate Stockman's SSS* algorithm, and proposed an improvement of the recursive RecSSS* [5] , initially developed by Subir Bhattacharya and Amitava Bagchi [6] . Despite promising results with some trees of depth 8, the space (memory) requirements were still very (too) high, and with the research of Aske Plaat, Wim Pijls and Arie de Bruin concerning Alpha-Beta with zero windows and transposition table in SSS* and Dual* as MT, SSS* was finally declared "dead" by Pijls and De Bruin in 1996 [7] .

Selected Publications

[8] [9]

1982 ...

1990 ...

2000 ...

External Links


  1. Alexander Reinefeld's homepage
  2. Paderborn Center for Parallel Computing
  3. Alexander Reinefeld (2005). Die Entwicklung der Spielprogrammierung: Von John von Neumann bis zu den hochparallelen Schachmaschinen. slides as pdf, Themen der Informatik im historischen Kontext Ringvorlesung an der HU Berlin, 02.06.2005 (English paper, German title)
  4. Alexander Reinefeld (1983). An Improvement to the Scout Tree-Search Algorithm. ICCA Journal, Vol. 6, No. 4, pdf
  5. Alexander Reinefeld (1994). A Minimax Algorithm Faster than Alpha-Beta. Advances in Computer Chess 7
  6. Subir Bhattacharya, Amitava Bagchi (1990). Unified Recursive Schemes for Search in Game Trees. Technical Report WPS-144, Indian Institute of Management, Calcutta
  7. Arie de Bruin, Wim Pijls (1997). SSS†. Advances in Computer Chess 8
  8. dblp: Alexander Reinefeld
  9. ICGA Reference Database (pdf)

Up one level