Computer Chess Club Archives

Search

Messages

Subject: Re: The 16 ply challenge restated

Author: Uri Blass

Date: 13:31:12 09/14/00

Go up one level in this thread

On September 14, 2000 at 15:55:55, Dann Corbit wrote:

>Here are a set of tough positions to search deeply.  Just finding a mate is not
>good enough, uless you can *prove* it is the shortest mate.

Finding a mate is good enough even if you cannot prove that it is the shortest
mate.

Doing mistakes of not finding the shortest mate is going to change nothing in
rating points so I do not see the importance of it for normal chess programs
that are not mate solvers.

I do not see the point of searching to 16 plies.
It is easy to search faster if you do more pruning.

Uri

• Re: The 16 ply challenge restated walter irvin 15:07:24 09/14/00
  • Re: The 16 ply challenge restated Dann Corbit 15:30:27 09/14/00
• Re: The 16 ply challenge restated Dann Corbit 13:43:24 09/14/00
  • Re: The 16 ply challenge restated Amir Ban 18:08:56 09/14/00
    • Re: The 16 ply challenge restated Dann Corbit 18:47:10 09/14/00
      • Re: The 16 ply challenge restated Gian-Carlo Pascutto 15:31:22 09/15/00
        • Re: The 16 ply challenge restated Dann Corbit 18:07:01 09/15/00
          • Re: The 16 ply challenge restated Gian-Carlo Pascutto 06:46:21 09/16/00
          • Re: The 16 ply challenge restated Uri Blass 00:38:21 09/16/00
  • Re: The 16 ply challenge restated Peter McKenzie 15:00:33 09/14/00
  • Re: The 16 ply challenge restated Ricardo Gibert 14:16:33 09/14/00
    • Re: The 16 ply challenge restated Dann Corbit 14:19:37 09/14/00
      • Re: The 16 ply challenge restated Ricardo Gibert 15:22:53 09/14/00
        • Ignore above (NT) Ricardo Gibert 15:25:50 09/14/00
      • Re: The 16 ply challenge restated Uri Blass 14:35:14 09/14/00

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.