Author: Uri Blass
Date: 01:14:46 05/23/02
Go up one level in this thread
On May 23, 2002 at 03:01:47, Matthias Gemuh wrote: >On May 23, 2002 at 01:34:08, Les Fernandez wrote: > >>I am interested to know an approximation as to how many ply current engines can >>"most" of the time find a mate sequence (assuming it exists). ie if we know >>there is a mate in 1 then obviously the engines will find this instantly, with >>or without tablebases. I suspect this is probably also true for mates in 3 or 4 >>plies also. What I am interested to know are most engines able to find mates in >>6,7 ...... + plies. What do most of you think is a safe ply number (upper >>limit) for current engines to find the mate without the use of tablebases? > > > >My HyLogic (150 kN/s on Athlon 1.4) finds some mates in 15 within 10 seconds. >Programs with good extensions should find mates in 20 ... 25 !! > >Regards, >Matthias. Yes but they can also miss shorter mates. It may be interesting to do a competition of composing chess problems when the target is to compose mate problems that no program can find a winning move in 3 minutes on the hardware of today. The target is to compose problems when the solution is as short as possible but inspite of it no program can find the mate. I guess that chest can find every mate in 4 or 5 in less than 3 minutes and I guess that if the target is only to compose a problem that chest cannot solve in less than 3 minutes then mate in 6 is needed. Note that I doubt if there is a mate in 6 from practical game that chest cannot solve in less than 3 minutes but I believe that if people works hard enough on composing complicated legal positions they may find one that chest need more than 3 minutes to solve mate in 6. If the target is to compose a problem when no program can find a winning move in less than 3 minutes then I suspect that mate in 7 is needed. It is only a guess and I do not know. Uri
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.