Computer Chess Club Archives

Search

Messages

Subject: Question to the engine developers

Author: Les Fernandez

Date: 22:34:08 05/22/02

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?

• Re: Question to the engine developers Vincent Diepeveen 07:43:13 05/24/02
• Thanks for your feedback (NT) Les Fernandez 06:37:30 05/23/02
• Re: Question to the engine developers Rafael Andrist 03:21:22 05/23/02
  • Re: Question to the engine developers Vincent Diepeveen 07:47:41 05/24/02
  • Re: Question to the engine developers Uri Blass 05:14:29 05/23/02
• Re: Question to the engine developers Matthias Gemuh 00:01:47 05/23/02
  • Re: Question to the engine developers Uri Blass 01:14:46 05/23/02
    • Re: Question to the engine developers Heiner Marxen 13:23:27 05/27/02

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.