Author: Russell Reagan
Date: 11:06:42 07/11/03
Go up one level in this thread
On July 11, 2003 at 13:23:32, Mihaly Szalai wrote:
>[D]2k5/1p1p1q1b/1PP1p2p/3PPpQp/5P1P/6KP/8/8 w - - 0 1
>1. Qd8+ Kxd8 2. c7+ Kc8 3. d6 Qg7+ 4. Kh2 $11 Bg8 5. Kh1 Qg3 1/2-1/2
Ruffian and Yace are both lost.
Ruffian 1.0.1
D17 02:44 -2.12 dxe6 Qxe6 cxd7 Qxd7 Qxh6 Qf7 Kh2 Bg6 Qh8 Kd7 Qa8 Kc6 Qa4
Kxb6 Qb4 Kc7 Qa5 Kc6 Qa4 Kc5 Qa3 Kb6
Yace Paderborn WB2 40 MB:
D14 01:30 -1.12 . 1.dxe6 Qxe6 2.cxd7+ Qxd7 3.Qxh6 Qf7 4.Kf2 Bg6 5.Ke1 Kd7
6.Qg5 Qe6 7.Qg1 Ke8 8.Qd4 Bf7 {HT} {-190}
My best guess is that after the search reaches this position:
[D]2k3b1/1pPp2q1/1P1Pp2p/4Pp1p/5P1P/7P/8/7K b - - 0 5
it will try a whole bunch of shuffling around moves because it thinks they are
better (more than a queen up!) than taking the draw. For instance, at ply 29
from this second position Ruffian still thinks black is winning (-10.09). It
takes 9 ply to even get to this second position, so for Ruffian to see the draw,
we're talking about a _deep_ search.
I think this could be solved with better evaluation (or at least better
understood, maybe with a score of around -1.00 or close to 0.00).
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.