Author: John Lowe
Date: 05:33:00 12/25/02
Go up one level in this thread
On December 25, 2002 at 08:11:55, Martin Giepmans wrote: >On December 25, 2002 at 00:51:57, John Lowe wrote: > >>On December 24, 2002 at 18:11:51, Martin Giepmans wrote: >> >>>On December 24, 2002 at 12:32:55, John Lowe wrote: >>> >>>>On December 23, 2002 at 15:37:07, Martin Giepmans wrote: >>>> >>>>>On December 23, 2002 at 15:16:44, Mike Byrne wrote: >>>>> >>>>>>[d]R6R/3Q4/1Q4Q1/4Q3/2Q4Q/Q4Q2/pp1Q4/kBNN1KB1 w - - 0 1 >>>>>> >>>>>>So far , every Palm program and Chess Tiger have fatal errors with this >>>>>>position. Supossedly, this is the largest number of possible legal number of >>>>>>moves, 218, available from one position in chess. If you can prove this wrong, >>>>>>you'll go down in History. >>>>>> >>>>>>http://www.rescon.de/Compu/schachzahl2_e.html >>>>> >>>>> >>>>>"Qd2xb2 mate!" says my program. 29 nodes calculated to find this brilliancy. >>>>> >>>>>It didn't blow up, the monitor didn't explode in my face, the AMD-processor >>>>>didn't implode, even my cigarette didn't catch fire ... >>>>> >>>>>I must say that I find this at least a little bit disappointing ;) >>>>> >>>>>Martin >>>> >>>>Hi Martin, >>>> >>>>You can borrow my failure if you like. >>> >>>Thanks! Do you really want it back? >>>> >>>>How did you manage to calculate 29 nodes before you found a mate in one? >>> >>>I don't know if you grinned when you wrote that. >>>Do you mean that 29 is way too much for a mate in (only) one <grin> >>>or do you mean that 29 is not enough? >>> >>>Martin >> >>Of course I grinned. The whole position is a party game. >> >>I'm trying to imagine which order you would have to evaluate moves in to have 28 >>misses before finding one of the mates. >> >29 nodes is the total number of nodes visited in the searchtree; even in >the first iteration this is usually (much) more than the number of moves >tried at the root. It probably did only a few moves at the root, found a >mate and stopped. > >>My program generates little piece moves first and would have stumbled over the >>knight mate - then it would(irrationally) have finished all the moves and >>selected its favourite mate - which is why it crashed..... >> >> >>Happy Christmas > >Happy Christmas too! DIY wants to know if it can be a Spider when it grows up.
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.