Author: Vincent Diepeveen
Date: 07:43:13 05/24/02
Go up one level in this thread
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? If it's forced for DIEP it's unlimited. But a mate in 15 usually is no problem. There is one exception, that's positions where *anything* wins. Then DIEP isn't going to search deeper for a mate soon. If however mating opponent is only thing to do better than draw, then a mate in 30 usually is no problems.
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.