Computer Chess Club Archives

Search

Messages

Subject: Re: One mate to solve.

Author: Angrim

Date: 10:19:40 10/10/01

Go up one level in this thread

On October 10, 2001 at 11:48:01, leonid wrote:

>Hello!
>
>This position is, probably, easy and solvable even by brute force.
>
>[D]B1nQKRQb/1QQ4b/nQ5q/R6p/Q6q/B5pN/R4q1p/qrrqkNq1 w - -
>
>Please indicate your result.
>
>Thanks,
>Leonid.

pn^2 on Athlon 1.2ghz:
proved that move g8e6 wins, 9 turns
PN2:10055380 evals, 249824 expands, 52.56 seconds

Angrim

• Re: One mate to solve. leonid 13:47:21 10/10/01
  • Re: One mate to solve. Can somebody verify minimal number of moves? leonid 16:44:12 10/10/01
    • Re: One mate to solve. Can somebody verify minimal number of moves? Paul 00:57:32 10/11/01
      • Re: One mate to solve. Can somebody verify minimal number of moves? leonid 03:48:37 10/11/01

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.