Author: Jon Dart
Date: 06:04:56 11/22/99
Go up one level in this thread
Arasan (latest build) solves #1 in under 1 second, for the same reason as Crafty (no checks in qsearch). #2 is solved in about 10 seconds on a 400MHz box: ply 1. Nc3 0 seconds. score: 0.19 39 nodes. ply 1. Nc3 0 seconds. score: 0.19 76 nodes. ply 2. Nc3 0 seconds. score: 0.06 540 nodes. ply 3. Nc3 0 seconds. score: 0.13 3205 nodes. ply 4. Nc3 0 seconds. score: 0.03 10998 nodes. ply 5. Nc3 1 seconds. score: 0.09 27006 nodes. ply 6. Na7 2 seconds. score: 0.72 106074 nodes. ply 6. Na7 2 seconds. score: 0.77 142788 nodes. ply 7. dxc5 5 seconds. score: 0.86 329814 nodes. ply 7. dxc5 5 seconds. score: 0.86 331330 nodes. ply 8. Nxd6 10 seconds. score: 0.95 793410 nodes. ply 8. Nxd6 11 seconds. score: 0.95 859258 nodes. ply 9. Nxd6 19 seconds. score: 1.53 1492144 nodes. ply 10. Nxd6 38 seconds. score: 1.52 3106895 nodes. Arasan makes very liberal use of the recapture extension. Here is the same position with recapture extensions disabled: ply 1. Nc3 0 seconds. score: 0.19 39 nodes. ply 1. Nc3 0 seconds. score: 0.19 76 nodes. ply 2. Nc3 0 seconds. score: 0.06 540 nodes. ply 3. Nc3 0 seconds. score: 0.13 3205 nodes. ply 4. Nc3 0 seconds. score: 0.03 10998 nodes. ply 5. Nc3 1 seconds. score: 0.09 26877 nodes. ply 6. Na7 2 seconds. score: 0.72 105313 nodes. ply 6. Na7 2 seconds. score: 0.77 141916 nodes. ply 7. dxc5 5 seconds. score: 0.86 312136 nodes. ply 7. dxc5 5 seconds. score: 0.86 313615 nodes. ply 8. dxc5 8 seconds. score: 0.81 595514 nodes. ply 9. Nxd6 25 seconds. score: 0.98 1870452 nodes. ply 9. Nxd6 28 seconds. score: 0.98 2066893 nodes. ply 10. Nxd6 54 seconds. score: 1.52 4264649 nodes.
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.