Author: Volker Pittlik
Date: 10:05:47 02/09/02
Go up one level in this thread
On February 09, 2002 at 10:47:32, Robert Hyatt wrote:
...
>I use a real tree search to order the ply-1 move list. There are so many
>possible captures in this position, that search takes a _long_ time. The
>current ply-1 ordering scheme works fine for games, but not for such
>composed positions...
You're right. After some time it started:
White(1): analyze
clearing hash tables
time surplus 0.00 time limit 30.00 (3:30)
nss depth time score variation (1)
starting thread 1
1 1.41 -37.13 1. Rhxa8 Bxc3 2. N6xe5 Qxf2+
1 33.24 -36.78 1. Ncd8+ Qaxd8 2. Rxc7+
1 34.38 -36.68 1. N6a5+ Qxa5 2. Rxc7+
(4) 1-> 37.86 -36.68 1. N6a5+ Qxa5 2. Rxc7+
2 38.24 ++ 1. N6a5+!!
(3) 2 42.50 -31.89 1. N6a5+ Bxa5 2. Bxd5+ Bxd5 3. Rxc7+
Nxc7 4. Rxa8 Bxc3 5. Qxd7 Nxd7 6. Nxe5
Qxf2+
(2) 2 59.05 -30.06 1. Ncd8+ Qaxd8 2. Bxd5+ Bxd5 3. Rxc7+
2-> 1:07 -30.06 1. Ncd8+ Qaxd8 2. Bxd5+ Bxd5 3. Rxc7+
3 1:09 -29.86 1. Ncd8+ Qcxd8 2. Nxd8+ Qdxd8 3. Bxd5+
Bxd5 4. Qxc2 Nxd6 5. Nxe5 Qxc2 6. Rxd8
Qxf2+
...
Volker
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.