Hi. I have learned the chess AI from https://www.chessprogramming.org/ and I’m interested in transposition table, which use to speed up the computing AI game. After i read the Wiki, my implementation that i can code is using unordered_map. And i found that the performance of table will affect the program significantly, and unordered_map isn’t the best option for the performance .
Do you have any suggestions for the tips to optimize the unordered_map or some generic hash map implementation that i can refer to ?
Thanks for your help.