Author: Mike Byrne
Date: 21:05:48 07/27/02
Go up one level in this thread
On July 23, 2002 at 18:32:27, Robert Hyatt wrote:
>A few years ago, Komputer Korner had a "correspondence kup" match with Crafty,
>chessmaster and some other programs, playing a correspondence tournament. In
>that match, Crafty found a wild sacrifice to play against Chessmaster, I think
>it was Nf6. After searching for 24 hours or whatever the time limit was, Crafty
>saw a draw score. And it saw a draw score for the next couple of moves.
>
>Right after Crafty played that move, Hsu sent me an email saying "brilliant
>move". I told him Crafty only saw a draw. He said "let it keep searching...
>DB Jr saw +2.5 very quickly." Sure enough, a few moves later Crafty realized
>it was not just drawing, it was winning easily.
>
>I will try to find the game. If anybody has it, perhaps _that_ position will
>be a good one to see how long it takes today's programs to find the move and
>find it is winning, compared to DB1 back in 1996...
>
>I will see what I can find...
>
>I think the event was called "the komputer kup korrespondence tournament" or
>something similar...
Crafty 17.14 SE (available by email to Mike Byrne @ mfbyrne_pa@msn.com)
finds the easy part Nf6 in 16 seconds , I will let it run overnight to see if it
turns positive
null depth set to 2/3 (min/max)
hash table memory = 96M bytes.
pawn hash table memory = 10M bytes.
EGTB cache memory = 30M bytes.
Extension booster set to 76 : 76 : 225 (base:max:intensity)
one-reply extension..................0.75
in-check extension..................1.00
recapture extension..................0.75
pushpp extension..................0.75
mate thrt extension..................1.00
singular extension..................0.75 (note : there is no singular or
recapture extension in this version)
Crafty v17.14 (2 cpus)
White(1): pon off
pondering disabled.
White(1): lea off
book learning disabled
result learning disabled
position learning disabled
White(1): st 60000
search time set to 60000.00.
White(1): st 6000000
search time set to 6000000.00.
White(1): [D] r1b1r1k1/1q3ppp/ppn5/2bNp3/P4B2/5Q1P/BP3PP1/R2R2K1 w - -
White(1): go
clearing hash tables
time surplus 0.00 time limit 100000:00 (100000:00)
nss depth time score variation (1)
starting thread 1
5-> 0.13 -0.49 1. Bg3 Bd4 2. Rd2 e4 3. Qf4
6 0.19 -0.68 1. Bg3 Bd4 2. Nc3 e4 3. Nxe4 Bxb2
(3) 6-> 0.41 -0.68 1. Bg3 Bd4 2. Nc3 e4 3. Nxe4 Bxb2
(2) 7 0.74 -0.65 1. Bg3 Nd4 2. Qe4 Rb8 3. Bc4 Bf5 4.
Qe3
7 1.91 -0.38 1. Be3 Re6 2. Bxc5 bxc5 3. Qc3 Rb8
4. Rd2
(3) 7-> 2.00 -0.38 1. Be3 Re6 2. Bxc5 bxc5 3. Qc3 Rb8
4. Rd2
(2) 8 3.19 -0.43 1. Be3 Be6 2. Bxc5 bxc5 3. Bb3 Rab8
4. Rd3 Qd7
(4) 8-> 7.17 -0.43 1. Be3 Be6 2. Bxc5 bxc5 3. Bb3 Rab8
4. Rd3 Qd7
(3) 9 8.67 -0.40 1. Be3 Be6 2. Qg3 Kh8 3. Bxc5 bxc5
4. Rd2 Qd7 5. Rad1
(2) 9 16.20 -0.08 1. Nf6+ gxf6 2. Bh6 Bf8 3. Bxf8 Kxf8
4. Qxf6 Re6 5. Bxe6 Bxe6 6. Qh8+ Ke7
7. Qxh7
(2) 9-> 25.02 -0.08 1. Nf6+ gxf6 2. Bh6 Bf8 3. Bxf8 Kxf8
4. Qxf6 Re6 5. Bxe6 Bxe6 6. Qh8+ Ke7
7. Qxh7
10 36.08 -0.30 1. Nf6+ gxf6 2. Bh6 Bf8 3. Bd5 e4 4.
Qg3+ Kh8 5. Qc3 Bxh6 6. Bxc6 Bd2 7.
Rxd2
(4) 10-> 1:27 -0.30 1. Nf6+ gxf6 2. Bh6 Bf8 3. Bd5 e4 4.
Qg3+ Kh8 5. Qc3 Bxh6 6. Bxc6 Bd2 7.
Rxd2
(3) 11 1:55 0.00 1. Nf6+ gxf6 2. Bh6 Bf8 3. Bd5 Bd7
4. Qxf6 Re6 5. Bxe6 Bxe6 6. Qg5+ Kh8
7. Bxf8 Rxf8 <HT>
(2) 11-> 2:34 0.00 1. Nf6+ gxf6 2. Bh6 Bf8 3. Bd5 Bd7
4. Qxf6 Re6 5. Bxe6 Bxe6 6. Qg5+ Kh8
7. Bxf8 Rxf8 <HT>
12 3:32 0.00 1. Nf6+ gxf6 2. Bh6 Bf8 3. Bd5 Bd7
4. Qxf6 Re6 5. Bxe6 Bxe6 6. Qg5+ Kh8
7. Bxf8 Rxf8 8. Qf6+ Kg8 9. Qg5+ Kh8
(3) 12-> 6:24 0.00 1. Nf6+ gxf6 2. Bh6 Bf8 3. Bd5 Bd7
4. Qxf6 Re6 5. Bxe6 Bxe6 6. Qg5+ Kh8
7. Bxf8 Rxf8 8. Qf6+ Kg8 9. Qg5+ Kh8
(2) 13 8:46 0.00 1. Nf6+ gxf6 2. Bh6 Bf8 3. Bd5 Bd7
4. Qxf6 Re6 5. Bxe6 Bxe6 6. Qg5+ Kh8
7. Bxf8 Rxf8 8. Qf6+ Kg8 9. Qg5+ Kh8
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.