Computer Chess Club Archives




Subject: Re: One mate to solve... that now is very easy.

Author: Paul

Date: 00:44:07 05/07/01

Go up one level in this thread

On May 07, 2001 at 03:18:23, Paul Byrne wrote:

[D]Qqrkrq1Q/1QqqqqQ1/qBbnnbBq/1NQ2QN1/8/2Q2Q2/3RR3/3K4 w - -

>G2K's PN search says:
>1W. i=8094 n=324622 p=0 d=1000000000 t=3.620
>1W. Qxc7 wins!
>3.62 seconds, 324633 nodes.  This is the kind of mate PN does well in, although
>it doesn't get you a mate-in-n number.

Hi Mr. Byrne,

I (still) haven't read anything about PN, but am very interested to learn ... is
there anything you can recommend for reading? The only thing I have is a
postscript doc by Victor Allis, that I think is about the subject (haven't got a
reader installed now), but maybe you know of something shorter/lighter to get
into it?

I understand from a remark by Heiner Marxen that you have to have plenty of
memory for PN search, presumably coz the search results have to be saved? But
why don't you have a winning variation (pv) and number then?

>>>[D]nqrkrqn1/1QqnnqQ1/1BnbbnB1/BQNNNNQB/8/8/3RR3/3KQ3 w - -

>And on this one,
>1W. i=255976 n=8485323 p=0 d=1000000000 t=76.740
>1W. Bxc7 wins!
>Which is interesting.  I think the first one was the easy one.  :)
>The non-checking move in there gives PN search a tough time.
>Thanks for the interesting problems...
>-paul [the other one  :)]

Yeah, it's a bit confusing, should maybe ask Steve to change my name ... but
it's nice to come into a forum and hear people whisper: "Hey, there's Paul!". ;)

>By the way, the second one is also a win in ICC's wild 17.  Forgot to switch
>variants on my first attempt...

Paul (the neutrally charged one :)

This page took 0.01 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.