Trevor Fenner

From Chessprogramming wiki
Revision as of 21:53, 6 May 2019 by GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Trevor Fenner''' FILE:TrevorFenner.JPG|border|right|thumb|link=http://www.dcs.bbk.ac.uk/%7Etrevor/| Trevor Fenner <ref>[http://www.dcs...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Home * People * Trevor Fenner

Trevor Fenner [1]

Trevor I. Fenner,
a British computer scientist at the School of Computer Science and Information Systems, Birkbeck College, University of London, where he already obtained his Ph.D. degree in 1978 under George Loizou [2]. His research interests include the general area of algorithms and data structures, particularly combinatorics and probabilistic algorithms. Along with Mark Levene, he published various papers on the topic of computer chess. While their 2008 paper Move Generation with Perfect Hashing Functions introducing Congruent Modulo Bitboards [3] provides mathematical insights in congruent modulo arithmetic, their final conclusion in comparison with Hashing Dictionaries, Rotated Bitboards and Magic Bitboards was criticized due to the obvious comparison with Kindergarten Bitboards [4].

Selected Publications

[5] [6] [7]

1970 ...

1980 ...

1990 ...

2000 ...

2010 ...

External Links

References

Up one level