Posted this position before. But I don't understand why my chess program plays a2-a1 and not Rg2. Or is a2-a1 better ? So first question: Is a2-a1 better.
info depth 1 score cp 328 time 0 nodes 139 pv e2f2
info depth 2 score cp 328 time 0 nodes 518 pv e2g2
info depth 3 score cp 338 time 0 nodes 1022 pv e2g2
info depth 4 score cp 338 time 0 nodes 2958 pv e2g2
info depth 5 score cp 341 time 0 nodes 7461 pv e2g2
info depth 6 score cp 343 time 0 nodes 24002 pv e2g2
info depth 7 score cp 340 time 0 nodes 50899 pv e2g2
info depth 8 score cp 346 time 0 nodes 149695 pv e2g2
info depth 9 score cp 346 time 1000 nodes 234630 pv e2g2
info depth 10 score cp 397 time 1000 nodes 694416 pv e2g2
info depth 11 score cp 407 time 1000 nodes 1242625 pv e2g2
info depth 12 score cp 407 time 1000 nodes 2189437 pv e2g2
info depth 13 score cp 417 time 1000 nodes 4116085 pv e2g2
info depth 14 score cp 407 time 2000 nodes 7943049 pv e2g2
If I had to take a guess at the issue, it would be this.
Your engine does not understand that promoting that pawn is worth (QueenValue - PawnValue).
#WeAreAllDraude #JusticeForDraude #RememberDraude #LeptirBigUltra "Those who can't do, clone instead" - Eduard ( A real life friend, not this forum's Eduard )
Abbess bounces around several e2 moves, with a score of 350-425. If I force a1=Q, it scores it at 331, so not much weaker. I don't think it would take a lot to get piece square tables to make you prefer one over the other.
If you force Rg2 or RxP, what does your engine evaluate on the next move?
Nightmare finds a forced line to a table-base position which is mate in xxx, without table-base it will never find it.
It is using 6 men Nalimov on SSD and probes at the leaves of the tree, but not in quiescence.
With the current crop of fast SSD's this is doable without much speed degradation.
With Nalimov on HD it usually probes 6 to 8 ply from the leaves, in this case the problem is the bad seek-time of mechanical disks.
Joost Buijs wrote:Nightmare finds a forced line to a table-base position which is mate in xxx, without table-base it will never find it.
It is using 6 men Nalimov on SSD and probes at the leaves of the tree, but not in quiescence.
With the current crop of fast SSD's this is doable without much speed degradation.
With Nalimov on HD it usually probes 6 to 8 ply from the leaves, in this case the problem is the bad seek-time of mechanical disks.