- Basic implementation of the aspiration windows
- Better Killer moves
- Principal Variation Search
- Basic implementation of Late Move Reduction
- Corrected some bugs with hash table and check problems
- Basic implementation of history heuristic
I didn't manage yet the following important points :
- to ameliorate the compatibility with UCI protocol
- to work on the evaluation function
- to implement some specific algorithms to play end games
But it will be probably the main points I will work on wih the next version.
Here are the results of the last tournament between nanook v0.16 and v0.17, this new version seems better... :-)
15 games of 5 minutes :
|Nanook_0-17||13,5/15||· ·· ·· ·· ·· ·· ··||=11111111111=1=||20,25|
|Nanook v0.16||1,5/15||=00000000000=0=||· ·· ·· ·· ·· ·· ··||20,25|
I still have a lot of improvements to do in order to have a Nanook Chess version not so weak... I work will work on it !