Author: Marc Bourzutschky
Date: 05:32:20 01/15/06
Go up one level in this thread
On January 15, 2006 at 05:30:18, Tony Werten wrote: >On January 14, 2006 at 14:25:38, Marc Bourzutschky wrote: > >>On January 14, 2006 at 13:15:20, Mark Rawlings wrote: >> >>>On January 14, 2006 at 08:59:29, Marc Bourzutschky wrote: >>> >>>>kqnnkqn, while generally a draw, contains positions that require up to 282 moves >>>>to capture or mate. This brings it very close to the current record holder >>>>krrnkrr which requires up to 290 moves. kqnnkqb looks to be in third place now >>>>with 272 moves, but that database has not yet been verified. kqnnkqn took about >>>>8.5 days to generate on a 3.8 GHZ Pentium machine, using Yakov Konoval's >>>>program. >>>> >>>>Note that play after the capture on move 282 will not be the same as would be >>>>obtained from a Nalimov database, because the latter maximizes distance to mate >>>>rather than distance to mate or capture. >>> >>>So, in other words, if the Nalimov database was computed for this, it may be a >>>mate in greater than 288, however there would be a capture in < 282, if I >>>understand correctly? >> >>All we know is that for a Nalimov database the mate would be in >= 282 moves. >>If the mate is in > 282 moves, than there must be a capture in <= 282 moves. > >I think you are wrong here. > >There are basicly 2 possibilities. The Nalimov egtb says <=282 or it says <282 >:) > No, the Nalimov result is _guaranteed_ to be >= 282 moves. Note also that the 50 move rule is ignored in both this and and the Nalimov database.
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.