Author: Terry Presgrove
Date: 12:51:14 07/24/99
Go up one level in this thread
Bob.....
I just downloaded the knpk.nbb.. and tried ths on my AMD 450.
Now mind you I specifically chose not to not get the promotional
knpk.nbw.. file. Here is the result.
white(1): analyze
end-game phase
clearing hash tables
time limit 7.50 (45.00)
s depth time score variation (1)
6 0.04 Mat23 1. Nd2+ Ke2 2. Nxc4 Kd3 3. Nxa5 <EGTB>
6-> 0.05 Mat23 1. Nd2+ Ke2 2. Nxc4 Kd3 3. Nxa5 <EGTB>
time=0.05 cpu=100% mat=2 n=5147 fh=98% nps=10000
ext-> checks=200 recaps=0 pawns=0 1rep=0 thrt:0
predicted=0 nodes=5147 evals=403
endgame tablebase-> probes done=139 successful=54
.
time limit 7.50 (45.00)
s depth time score variation (1)
1 0.00 Mat23 1. Nd2+ Ke2 2. Nxc4 Kd3 3. Nxa5 <HT>
1-> 0.00 Mat23 1. Nd2+ Ke2 2. Nxc4 Kd3 3. Nxa5 <HT>
2 0.00 Mat23 1. Nd2+ Ke2 2. Nxc4 Kd3 3. Nxa5 <HT>
2-> 0.00 Mat23 1. Nd2+ Ke2 2. Nxc4 Kd3 3. Nxa5 <HT>
3 0.00 Mat23 1. Nd2+ Ke2 2. Nxc4 Kd3 3. Nxa5 <HT>
3-> 0.00 Mat23 1. Nd2+ Ke2 2. Nxc4 Kd3 3. Nxa5 <HT>
4 0.00 Mat23 1. Nd2+ Ke2 2. Nxc4 Kd3 3. Nxa5 <HT>
4-> 0.00 Mat23 1. Nd2+ Ke2 2. Nxc4 Kd3 3. Nxa5 <HT>
The code is for sure working but what I don't understand is how
crafty found mate this fast using only the knpk.nbb.. file??
TP
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.