4.3.17 Hashtables

The term hashtables stands for an algorithm in which the program stores the results of its evaluations into the PC memory.

This is very helpful for the program: when the program finds a position in the hashtable that was already evaluated, then there is no need to evaluate the position again since the result is already known.

This technique makes it possible to speed up the search process by a factor of three, and even more in the endgame.

At the start of the program, Rebel will try to reserve as much free memory as possible: the more free memory, the more positions the program can store. With this option you can change the size of the hashtables. Of course you cannot make the hashtable bigger than the size of free memory you have left on your computer.