Author: Paul
Date: 12:13:16 05/01/01
Go up one level in this thread
On May 01, 2001 at 07:55:26, leonid wrote: >On May 01, 2001 at 01:02:33, Paul Byrne wrote: > >>That was a tough one! My PN search went through 512MB of memory without solving >>it. PN2 got Qbxd8+ winning in 1316.46 seconds (100043829 nodes) -- the PN2 code > >Hi, Paul! > >What is PN2? > >Your move is what mine found. > >Your solution was quick compared with mine. I actually had the impression that >this position contain the mate and asked to search this position. Very deep >selective search, 13 moves deep. Left my solver thinking in the night. Celeron >600Mhz. No hash. It took almost 4 hours (3 h 56 min) to solve in 13 moves. But >at what depth your found? Maybe your said that mate existe in 12 or even 11. > >Cheers, >Leonid. Hi Leonid! I hope you're not confusing Paul Byrne and me (just Paul) ... because it was me who said in a joke after finding a mate in 13, that I thought it probably was a mate in 12. I wrote that because often after I've posted one of my solutions, Heiner comes along with his superior Champion! :) solver Chest, posting a mate in at least one move less than mine. So I'm more or less convinced that whenever I find a mate, the shortest solution will be (at least) one move shorter. Paul Byrne's program is called G2K, mine is Pretz ... ok, just to clear that up! But maybe you weren't confused, in that case I didn't write this! ;) Salut!, Paul
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.