Thanks for your reply.

Is it worth probing the hash table at the leaf nodes to see if you can find a score? (I haven't implemented move ordering or probing the hash table at interior nodes yet).

Right now I have a very basic evaluation function (just material and PSQ), and it takes almost no time ...

I have a basic search using alpha beta (negamax). I want to implement a transposition table, but I'm not sure if I am doing it correctly. Here's what I have in mind:


At the root:
- Store the depth, score, node type (PV), and best move
- When generating moves, look for the entry in the table ...