Hardware: Intel Q8400 2.66GHz 4GB RAM
Operating system: Microsoft Windows XP 64 Bit Professional
All engines 1 CPU (SSE versions when available)
Arena 2.0.1 GUI
128MB Hash Tables
3-4-5 EGTBs in SSD
Ponder off
Book ECO_500_Most_Played (from the last 30 years, based on Norm Pollock collections), each pair plays the same position with switched colours.
40 moves in 28 minutes repeating (adapted to the CCRL 40/40 standard)
Hardware: Intel Q8400 2.66GHz 4GB RAM
Operating system: Microsoft Windows XP 64 Bit Professional
All engines 1 CPU (SSE versions when available)
Arena 2.0.1 GUI
128MB Hash Tables
3-4-5 EGTBs in SSD
Ponder off
Book ECO_500_Most_Played (from the last 30 years, based on Norm Pollock collections), each pair plays the same position with switched colours.
40 moves in 28 minutes repeating (adapted to the CCRL 40/40 standard)
It confirms my intuition that DoubleCheck performs somewhat worse at long time control than in blitz. And the reason is that, compared to its "peers", it has a more efficient search but very little chess knowledge.
I'll certainly have a closer look at the games. I will probably find some some chess knowledge to improve its play, especially in the endgame, where it's not very good.
lucasart wrote:
I'll certainly have a closer look at the games. I will probably find some some chess knowledge to improve its play, especially in the endgame, where it's not very good.
Out of the many bad moves that DoubleCheck playes, I would see 2 typical patterns that it wasn't able to recognize:
1/ doubled rooks on an open file. This helped me spot a bad bug in my mobility evaluation function, where the mobility count is not accounting for squares that each rook sees through the other rook.
2/ knight outposts. A knight that is defended by a pawn, where the pawn cannot be exchanged by another pawn, often becomes a real thorn in the enemy flank; especially when the knight is on the 6-th rank.