Author: leonid
Date: 17:19:09 01/21/01
Go up one level in this thread
On January 21, 2001 at 19:38:53, leonid wrote: >On January 21, 2001 at 18:02:44, Paul wrote: > >>On January 21, 2001 at 17:25:53, leonid wrote: >> >>>If you program found mate in 12 moves ahead, in this situation, it is rock >>>solid! >> >>Unfortunately it isn't :) The movegenerator & search parts are ok I think. >>However, I have problems with mates from EndGameTables ... but I will find >>the bug soon I hope! > > >If this is not the author secret, please say what it is "EndGameTables"? > > >>>This was surprise for me! Only when Heiner found that there is no mate in 10 >>>that I understood that this position is very deep. My program will never see all >>>those 12 moves completely. Too much time. I create all my positions by using my >>>selective search. I try to find what is the minimum number of moves that lead to >>>the mate but not beyond 6. For this I should have, at least, better computer and >>>hash in my program. >> >>It was pretty deep! And the solution is pretty also! I have a nice GUI ... >>hmmm ... Graphical User Interface :), so when my program finds the first >>move it immediately plays out the entire mate from hash, and with all those >>Queens sliding across the board ... it was a pretty sight!! >> >>Here's a problem for you in return my friend, it's not mine however: >> >>[D]5n2/B3K3/2p2Np1/4k3/7P/3bN1P1/2Prn1P1/1q6 w - - 0 1 >> >>The solution is also very funny, but be warned! it's verrrry deep :) >>Mine solves this instantly ;) If this is the positions that is 30 moves deep, just read in other message, I give up and you are winner! Mine don't search more that 13 moves. Leonid. >>Groetjes, >>Paul > >Thanks! Will try your. > >Leonid.
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.