25,161
edits
Changes
Created page with "'''Home * People * Stefan Plenkner''' '''Stefan Plenkner''',<br/> a German computer scientist, during the 90s interested on chess programming topics. He pub..."
'''[[Main Page|Home]] * [[People]] * Stefan Plenkner'''
'''Stefan Plenkner''',<br/>
a German computer scientist, during the 90s interested on chess programming topics. He published the paper on [[Null Move Pruning#ZugzwangVerification|Zugzwang Verification]] in [[Null Move Pruning]] in the June 1995 issue of the [[ICGA Journal#18_2|ICCA Journal]], dubbed '''Tempo Search''' <ref>[[Stefan Plenkner]] ('''1995'''). ''A Null-Move Technique Impervious to Zugzwang.'' [[ICGA Journal#18_2|ICCA Journal, Vol. 18, No. 2]]</ref>, heavily discussed in [[Computer Chess Forums|news groups]] <ref>[https://groups.google.com/d/msg/rec.games.chess.computer/hEbdgYTQ5hI/Ng4job9IQp8J Looking for Stefan Plenkner] by [[Mark Lefler]], [[Computer Chess Forums|rgcc]], September 06, 1995</ref> <ref>[https://groups.google.com/d/msg/rec.games.chess.computer/CEC8iqvQ9uU/luZclEHNGC8J Null-move zugzwang avoidance, Jun '95 ICCAJ] by [[Bruce Moreland]], [[Computer Chess Forums|rgcc]], December 6, 1996</ref>.
Stefan further introduced the [[BitScan#BitscanByModulo|modulo 67 trick]] for [[BitScan]] purpose <ref>[https://groups.google.com/d/msg/rec.games.chess.computer/1dvwjGboNRc/uL-loAIdcDsJ bitboard 2^i mod 67 is unique] by [[Stefan Plenkner]], [[Computer Chess Forums|rgcc]], August 6, 1996</ref>,
and asked for a fast modulo implementation in [[Computer Chess Forums|rgcc]] <ref>[https://groups.google.com/d/msg/rec.games.chess.computer/llgAnjFQIf4/2RwwDLKvxoAJ bitboard 2^i mod 67 is unique] by [[Stefan Plenkner]], [[Computer Chess Forums|rgcc]], August 7, 1996</ref>
<ref>[https://groups.google.com/d/msg/rec.games.chess.computer/llgAnjFQIf4/OizMezmVSjgJ Re: bitboard 2^i mod 67 is unique] by [[Joël Rivat]], [[Computer Chess Forums|rgcc]], September 2, 1996</ref>.
=Publications=
<ref>[https://content.iospress.com/search?q=author%3A%28%22Plenkner%2C+Stefan%22%29 Author:("Plenkner, Stefan") - IOS Press]</ref>
* [[Stefan Plenkner]] ('''1995'''). ''[https://ilk.uvt.nl/icga/journal/contents/node13.html A Null-Move Technique Impervious to Zugzwang]''. [[ICGA Journal#18_2|ICCA Journal, Vol. 18, No. 2]]
=Forum Posts=
* [https://groups.google.com/d/msg/rec.games.chess.computer/hEbdgYTQ5hI/Ng4job9IQp8J Looking for Stefan Plenkner] by [[Mark Lefler]], [[Computer Chess Forums|rgcc]], September 06, 1995
* [https://groups.google.com/d/msg/rec.games.chess.computer/1dvwjGboNRc/uL-loAIdcDsJ bitboard 2^i mod 67 is unique] by [[Stefan Plenkner]], [[Computer Chess Forums|rgcc]], August 6, 1996
* [https://groups.google.com/d/msg/rec.games.chess.computer/llgAnjFQIf4/2RwwDLKvxoAJ bitboard 2^i mod 67 is unique] by [[Stefan Plenkner]], [[Computer Chess Forums|rgcc]], August 7, 1996
=References=
<references />
'''[[People|Up one level]]'''
'''Stefan Plenkner''',<br/>
a German computer scientist, during the 90s interested on chess programming topics. He published the paper on [[Null Move Pruning#ZugzwangVerification|Zugzwang Verification]] in [[Null Move Pruning]] in the June 1995 issue of the [[ICGA Journal#18_2|ICCA Journal]], dubbed '''Tempo Search''' <ref>[[Stefan Plenkner]] ('''1995'''). ''A Null-Move Technique Impervious to Zugzwang.'' [[ICGA Journal#18_2|ICCA Journal, Vol. 18, No. 2]]</ref>, heavily discussed in [[Computer Chess Forums|news groups]] <ref>[https://groups.google.com/d/msg/rec.games.chess.computer/hEbdgYTQ5hI/Ng4job9IQp8J Looking for Stefan Plenkner] by [[Mark Lefler]], [[Computer Chess Forums|rgcc]], September 06, 1995</ref> <ref>[https://groups.google.com/d/msg/rec.games.chess.computer/CEC8iqvQ9uU/luZclEHNGC8J Null-move zugzwang avoidance, Jun '95 ICCAJ] by [[Bruce Moreland]], [[Computer Chess Forums|rgcc]], December 6, 1996</ref>.
Stefan further introduced the [[BitScan#BitscanByModulo|modulo 67 trick]] for [[BitScan]] purpose <ref>[https://groups.google.com/d/msg/rec.games.chess.computer/1dvwjGboNRc/uL-loAIdcDsJ bitboard 2^i mod 67 is unique] by [[Stefan Plenkner]], [[Computer Chess Forums|rgcc]], August 6, 1996</ref>,
and asked for a fast modulo implementation in [[Computer Chess Forums|rgcc]] <ref>[https://groups.google.com/d/msg/rec.games.chess.computer/llgAnjFQIf4/2RwwDLKvxoAJ bitboard 2^i mod 67 is unique] by [[Stefan Plenkner]], [[Computer Chess Forums|rgcc]], August 7, 1996</ref>
<ref>[https://groups.google.com/d/msg/rec.games.chess.computer/llgAnjFQIf4/OizMezmVSjgJ Re: bitboard 2^i mod 67 is unique] by [[Joël Rivat]], [[Computer Chess Forums|rgcc]], September 2, 1996</ref>.
=Publications=
<ref>[https://content.iospress.com/search?q=author%3A%28%22Plenkner%2C+Stefan%22%29 Author:("Plenkner, Stefan") - IOS Press]</ref>
* [[Stefan Plenkner]] ('''1995'''). ''[https://ilk.uvt.nl/icga/journal/contents/node13.html A Null-Move Technique Impervious to Zugzwang]''. [[ICGA Journal#18_2|ICCA Journal, Vol. 18, No. 2]]
=Forum Posts=
* [https://groups.google.com/d/msg/rec.games.chess.computer/hEbdgYTQ5hI/Ng4job9IQp8J Looking for Stefan Plenkner] by [[Mark Lefler]], [[Computer Chess Forums|rgcc]], September 06, 1995
* [https://groups.google.com/d/msg/rec.games.chess.computer/1dvwjGboNRc/uL-loAIdcDsJ bitboard 2^i mod 67 is unique] by [[Stefan Plenkner]], [[Computer Chess Forums|rgcc]], August 6, 1996
* [https://groups.google.com/d/msg/rec.games.chess.computer/llgAnjFQIf4/2RwwDLKvxoAJ bitboard 2^i mod 67 is unique] by [[Stefan Plenkner]], [[Computer Chess Forums|rgcc]], August 7, 1996
=References=
<references />
'''[[People|Up one level]]'''
