Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Nolot 11 Solved again

Author: Jeremiah Penery

Date: 22:39:23 02/13/01

Go up one level in this thread


On February 13, 2001 at 20:43:07, Joshua Lee wrote:

>No i am just showing that this isn't tough compared to the others and i think
>there should be a new suite with problems not solved under 1hour but some
>positions are solve in 30minutes with one program and 5 with another....

I think it would be really neat if someone created a new set of positions to
perhaps replace the Nolot ones.  It's known that a couple of the Nolot solutions
are at least slightly dubious (#9 being foremost, #3 and #6 might also be, and
it can be argued that the solution to #8 may not be the "best" move).  Also
nowadays, at least #11 is too easy for computers to be in a suite of "unsolvable
by computer" problems.

Maybe if I have the time I'll look for some positions where the solution is
really the best move, provide/find analysis for them, and make sure they're
really hard for computers.

One position that comes to mind already is Shirov's 47. ...Bh3!! against
Topalov, Linares 1998:
(I hope the diagram is correct.)
[D]8/8/4kpp1/3p1b2/p6P/2B5/6P1/6K1 b - -

Computers find this extremely difficult, at the least. :)



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.