Yace 0.22 vs Yace 0.22 Corbit Version (speed test)

[Johan Havegheer]

Geschrieben von: / Posted by: Johan Havegheer at 28 July 2000 18:37:44:
Hello,
I've tested both versions on my Pentium III Coppermine 566Mhz (103*5.5)
Yace 0.22 :
6 Tested , 4 Found , 0 mates
44306523 nodes in 175.28 sec = 252.777 nps
Yace 0.22 Corbit :
6 Tested , 4 Found , 0 mates
44671865 nodes in 175.25 sec = 254.901 nps
About 0.8% speed gain !!!
Not so impressive, isn't it.
Johan

[He puzzled about the digi]

Geschrieben von: / Posted by: He puzzled about the digit 7: Dann Corbit at 28 July 2000 20:29:39:
Als Antwort auf: / As an answer to: Yace 0.22 vs Yace 0.22 Corbit Version (speed test) geschrieben von: / posted by: Johan Havegheer at 28 July 2000 18:37:44:

Hello,
I've tested both versions on my Pentium III Coppermine 566Mhz (103*5.5)
Yace 0.22 :
6 Tested , 4 Found , 0 mates
44306523 nodes in 175.28 sec = 252.777 nps
Yace 0.22 Corbit :
6 Tested , 4 Found , 0 mates
44671865 nodes in 175.25 sec = 254.901 nps
About 0.8% speed gain !!!
Not so impressive, isn't it.

Depends on how you look at the numbers.
Dann compiled Yace nodes:
E:\PROGRA~2\winboard>factor 44671865
first trying brute force division by small primes
PRIME FACTOR 5
PRIME FACTOR 7
PRIME FACTOR 23
PRIME FACTOR 211
PRIME FACTOR 263
Dieter compiled Yace Nodes:
E:\PROGRA~2\winboard>factor 44306523
first trying brute force division by small primes
PRIME FACTOR 3
PRIME FACTOR 3
PRIME FACTOR 1657
PRIME FACTOR 2971
And their difference being 365342 nodes, is also a composite!:
E:\PROGRA~2\winboard>factor 365342
first trying brute force division by small primes
PRIME FACTOR 2
PRIME FACTOR 29
PRIME FACTOR 6299
And did you notice that there is not a *single* common factor?
Now that's what I call impressive.



my ftp site