Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: How Greedy is your Program? Good Positional Test!

Author: Howard Exner

Date: 02:48:21 04/18/99

Go up one level in this thread


On April 18, 1999 at 00:41:51, Bruce Moreland wrote:

>
>On April 17, 1999 at 10:13:07, Brian Smith wrote:
>
>>On April 15, 1999 at 23:44:46, Micheal Cummings wrote:
>>
>>>
>>>On April 15, 1999 at 23:15:08, odell hall wrote:
>>>
>>>>Hi
>>>>
>>>>
>>>>The below position is taken from the Book Secrets of Chess Analysis by Jan
>>>>timman.
>>>>
>>>>3q1rk1/1p3p2/r2p2pb/P1pP1n1p/2N2P2/1QPP4/6BP/1R3RK1 w - - id Geller - Spaasky;
>>>
>>>CM6K after 20sec likes Bh3, And at 5mins when I stopped the Analysis it still
>>>liked it with Bh3   +1.01
>>
>>Yes, but later on it switches to Qb7 and then back to Bh3 after it sees Rxa5.
>>(Before that it didn't play Qb7 for other reasons.)  I wonnder how many programs
>>actually see Rxa5...
>
>What makes you think it sees Rxa5 ?
>
>bruce

I have my doubts that programs will play Rxa5. I would have liked to see
the move sequence of that Timman suggests after 1. Qxb7 Rxa5 ...

My guess is that many programs will see a transposition between Qxb7
and Be4. For example, 1. Qxb7 Ra8 2. Be4 vs 1. Be4 (black plays some move
to avoid the threat of Bxf5) 2. Qxb7 ...

I disagree that this is a good positional test that only the strongest of
programs will find.



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.