Author: Paul
Date: 08:41:18 02/03/01
Go up one level in this thread
On February 03, 2001 at 10:38:26, leonid wrote: >On February 03, 2001 at 09:10:01, Paul wrote: > >>Mine says a Mate in 11 :) >> >>00:21 BM11 08 1... Bxg5+ 2. Rxg5 Bxg5+ 3. Rxg5 Bxg5+ 4. Bhxg5 Bxg5+ 5. Bxg5 >>Bxg5+ 6. Rxg5 Ng4+ 7. Rxg4 Qf4+ 8. Nhxf4 Qxf4+ 9. Nxf4 Nxf4+ 10. Qg6 Rh5+ 11. >>Qxh5 Rxh5# > >It is likely that in 11 moves it is the quickest solution that my program can >find through selective search. It find in 10 moves as well but it take much >longer time. The most probable that solution is even in much lower level. >Shortest mate I don't know for this moment. So your selective search also finds a Mate in 10 if you let it 'think' longer? Do I understand that correctly? Sometimes mine also does that, but not here. The funny thing was that Pretz announced a Mate in 12 after 21 seconds, but when it played the line out from hash after ~50 seconds it found a better move somewhere along the way and finished in 11 moves :) So there is something strange going on in my hashtable; but I'm afraid that if I remove the bug, it won't find the mates this fast anymore, ha! ;) So I admit that in the line above I cheated a little, coz it originally said BM12, I changed that by hand to BM11 (Black Mates in 11) ... yes, I'm ashamed :) ciao!, :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.