Author: leonid
Date: 12:08:12 09/10/01
Go up one level in this thread
On September 10, 2001 at 13:44:53, Angrim wrote: >On September 10, 2001 at 13:07:23, leonid wrote: > >>[D]2qk4/1pq2qrp/bnq5/b1q1NQPP/2n1RNBB/2r5/2p1QQPQ/2q1RQQK w - - >> >>Please indicate your result. >> >>Thanks, >>Leonid. > >yep, easy. > >pn^2 search: >proved that move e5xf7 wins, 8 turns >PN2:45028 evals, 1659 expands, 0.26 seconds > >pn-search: >proved that move f5xc8 wins, 8 turns >PN:89800 evals, 3517 expands, 0.58 seconds > >notice that the two slightly different search methods found different >winning moves. > >Angrim Hi, Angrim! I find your result superb! Your selective do fine. Mine on Celeron 600, no hash, is 0.879 sec. I want to ask you something. I found yesterday that we have on the Net one mate solver that never came to this Club. Its name is MateMaster. I had the trouble in uploading its free version on my computer. Problem could be with the server and contain this solver, or even more probable with my telephone line. If you have it somehow and could indicate its time for this position, or every other that you like, it will be fine. The best for me it will be not so much finding the mate but giving me some idea where is its brute force branching factor situated. For this you could just find time for some position (maybe for actual one) for 4 and 5 moves deep. It is for seeing this aspect that I wanted to upload this program on the first place. Thanks in advance, Leonid.
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.