Author: leonid
Date: 04:48:43 07/01/01
Go up one level in this thread
On July 01, 2001 at 00:25:52, Angrim wrote: >On June 30, 2001 at 06:47:19, leonid wrote: > >>Hi! >> >>If you are in mood to solve some mate position, look into this: >> >>[D]Q2nkn1q/1Q1rr1q1/2QQqq2/b2Qq2b/2NqQN2/2q2Q2/1q1BB1Q1/q2RKR1Q w - - >> >>Please indicate your result. >> >>Try to indicate all basic parameters about your hardware and name your program. >>If your program have some Web Site, please say its address. If something new was >>done in order to speed your mate solving brain, feel you free to describe your >>improvement. At least one person will read it with big interest for sure. >> >>Thanks, >>Leonid. > >Hey, looks like I got the first reply this time :) >hardware: Athlon 650mhz >heuristic: PN^2 with transpositions Hi! I see that your program take well those positions. This last one was slow even for my solver. >proved that move f3xh5 wins, 12 turns I am not sure what is "12 turns". Twelve moves deep? Cheers, Leonid. >PN2:17137399 evals, 368084 expands, 148.10 seconds Yes, and still what is everage NPS for your program since we have almost identical hardware? I am not sure how to read "evals" and "expands". Mine is Celeron 600Mhz. I don't know exactly NPS (node/per/second) for this position for shortest move, since mine solved it by selective and went by brute force only as far as to be sure how big is shortest move. For selective, for shortest mate, NPS was 697k and for brute force (just one move below the last) was 93k. My program don't use hash, this must make mine NPS somewhat higher that it should be. If I forget your "expand", your average is 115k. Something that still look like we have close NPS numbers. Leonid. >Angrim
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.