25,161
edits
Changes
no edit summary
His research interests include the general area of [[Algorithms|algorithms]] and [[Data|data structures]], particularly [https://en.wikipedia.org/wiki/Combinatorics combinatorics] and [https://en.wikipedia.org/wiki/Randomized_algorithm 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]] <ref>[[Trevor Fenner]], [[Mark Levene]] ('''2008'''). ''Move Generation with Perfect Hashing Functions.'' [[ICGA Journal#31_1|ICGA Journal, Vol. 31, No. 1]], [http://www.dcs.bbk.ac.uk/~mark/download/bitboard_sliding_icga_final.pdf pdf]</ref>
provides mathematical insights in [https://en.wikipedia.org/wiki/Modulo Congruence_relation congruent modulo] [https://en.wikipedia.org/wiki/Modular_arithmetic modular arithmetic], their final conclusion in comparison with [[Hashing Dictionaries]], [[Rotated Bitboards]] and [[Magic Bitboards]] was criticized due to the obvious comparison with [[Kindergarten Bitboards]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=20913 Nice Math - Strange Conclusions] by [[Gerd Isenberg]], [[CCC]], April 29, 2008</ref>.
=Selected Publications=
