Author: Dann Corbit
Date: 22:43:43 10/05/00
Go up one level in this thread
On October 05, 2000 at 22:48:40, Steffen Jakob wrote:
>Hi!
>
>Here comes a position from a game Hossa - Arasan:
>
>[D]r3r1k1/3q2p1/2p1ppQP/2P3p1/1p1P4/pPb1RN2/P4P2/1K5R w
>
>There are two moves which are winning fast: Ne5 and Nxg5 (e.g. 1.Nxg5 fxg5 2.
>Reh3 +-). Hossa missed those moves and lost the game. First I thought that this
>should be very easy to find for a comp but after having talked to some
>programmers I saw that other programs also need more time than I expected (at
>least too long for a blitz game). How long does your favourite program take to
>see either Ne5 or Nxg5 with a +- score (something like +0.5 doesnt count)?
ColChess:
Test #1 : White to play
Current Position
----------------
r . . . r . k .
. . . q . . p . pP=Pawn
. . p . p p Q P rR=Rook
. . P . . . p . nN=Knight lower=Black
. p . P . . . . bB=Bishop CAPS=White
p P b . R N . . qQ=Queen
P . . . . P . . kK=King
. K . . . . . R
Thinking [39 Moves]
Current Position=-0.79
{L2} :::::::::::::::::::. H6 - H7 (4.21) Nodes=2433 Eval=1215 [0.04s]
{L3} :::::::::::::::::::. H6 - H7 (0.69) Nodes=7993 Eval=4984 [0.13s]
{L4} :::::::::::::::::::. B1 - C2 (0.78) Nodes=180589 Eval=92026 [1.68s]
{L5} :::::::::::::::::::. E3 - E4 (0.88) Nodes=245509 Eval=115306 [3.62s]
{L6} :::::::::::::::::::. B1 - C2 (0.81) Nodes=2581386 Eval=887275 [18.54s]
{L7} :::::::::::::::::::. B1 - C2 (0.81) Nodes=2501215 Eval=1148203
[38.08s]
{L8} :::::::::::::::::::. F3 x G5 (0.93) Nodes=30429105 Eval=7764532
[171.4s]
{L9} :::::::::::::::::::. F3 x G5 (1.21) Nodes=53544491 Eval=25055403
[611.2s]
{L10} .2 (ABORT) F3 x G5 (1.21) Nodes=31792925 Eval=6608801 [721.9s]
12 Minutes, 2 Second - D'oh
Nodes=121285646 Eval=41677745
Table Hits=611728 [310689 Entries]
PV : f3g5 f6g5 e3h3 g5g4 h3h4 c3d2 h6g7 d2h6 g6h6
---Answer: Qf7 ~Incorrect-??
Correct So Far: 0[0]/1
Result: 0[0]/1 (0%)[0%]
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.