The transposition tables use zobrist hashing. The addition of this increases the time for each evaluation to around 10 microseconds (from 45 -> 55). This is pretty much unavoidable, however it would be possible to reduce 5 microseconds if we would use C for the whole evaluation function. This would also reduce the total time (I would guess by around 20 microseconds, definitely not any more then that).
The transposition tables use zobrist hashing. The addition of this increases the time for each evaluation to around 10 microseconds (from 45 -> 55). This is pretty much unavoidable, however it would be possible to reduce 5 microseconds if we would use C for the whole evaluation function. This would also reduce the total time (I would guess by around 20 microseconds, definitely not any more then that).