Difference between revisions of "Stefan Plenkner"
GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Stefan Plenkner''' '''Stefan Plenkner''',<br/> a German computer scientist, during the 90s interested on chess programming topics. He pub...") |
(No difference)
|
Latest revision as of 12:29, 24 January 2019
Home * People * Stefan Plenkner
Stefan Plenkner,
a German computer scientist, during the 90s interested on chess programming topics. He published the paper on Zugzwang Verification in Null Move Pruning in the June 1995 issue of the ICCA Journal, dubbed Tempo Search [1], heavily discussed in news groups [2] [3].
Stefan further introduced the modulo 67 trick for BitScan purpose [4],
and asked for a fast modulo implementation in rgcc [5]
[6].
Publications
Forum Posts
- Looking for Stefan Plenkner by Mark Lefler, rgcc, September 06, 1995
- bitboard 2^i mod 67 is unique by Stefan Plenkner, rgcc, August 6, 1996
- bitboard 2^i mod 67 is unique by Stefan Plenkner, rgcc, August 7, 1996
References
- ↑ Stefan Plenkner (1995). A Null-Move Technique Impervious to Zugzwang. ICCA Journal, Vol. 18, No. 2
- ↑ Looking for Stefan Plenkner by Mark Lefler, rgcc, September 06, 1995
- ↑ Null-move zugzwang avoidance, Jun '95 ICCAJ by Bruce Moreland, rgcc, December 6, 1996
- ↑ bitboard 2^i mod 67 is unique by Stefan Plenkner, rgcc, August 6, 1996
- ↑ bitboard 2^i mod 67 is unique by Stefan Plenkner, rgcc, August 7, 1996
- ↑ Re: bitboard 2^i mod 67 is unique by Joël Rivat, rgcc, September 2, 1996
- ↑ Author:("Plenkner, Stefan") - IOS Press
