Trevor Fenner, a British computer scientist at the School of Computer Science and Information Systems [1], Birkbeck College, University of London. Along with Mark Levene, he published various paper on the topic of computer chess. While their 2008 paper about Congruent Modulo Bitboards [2] provides great 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 [3].
Trevor Fenner [4]

Selected Publications

• Mark Levene, Trevor Fenner (1995). A Partial Analysis of Minimaxing Game Trees with Random Leaf Values. ICCA Journal, Vol. 18, No. 1, zipped ps
• Mark Levene, Trevor Fenner (2001). The Effect of Mobility on Minimaxing of Game Trees with Random Leaf Values. Artificial Intelligence, Vol. 130, No. 1, Review in ICGA Journal, Vol. 24, No. 4, pdf
• Trevor Fenner, Mark Levene (2008). Move Generation with Perfect Hashing Functions. ICGA Journal, Vol. 31, No. 1, pdf
• Mark Levene, Trevor Fenner (2009). A Methodology for Learning Players' Styles from Game Records. arXiv:0904.2595v1
• Trevor Fenner, Mark Levene, George Loizou (2011). A Discrete Evolutionary Model for Chess Players' Ratings. Physics and Society, arXiv:1103.1530v2

External Links

• Trevor Fenner's Home Page

References

1. ^ School of Computer Science and Information Systems
2. ^ Trevor Fenner, Mark Levene (2008). Move Generation with Perfect Hashing Functions. ICGA Journal, Vol. 31, No. 1, pp. 3-12. pdf
3. ^ Nice Math - Strange Conclusions by Gerd Isenberg, CCC, April 29, 2008
4. ^ Trevor Fenner's Home Page
5. ^ ICGA Reference Database (pdf)
6. ^ Mark Levene - Online papers

What links here?