Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Mystery solved by Gambit Tiger

Author: Hermano Ecuadoriano

Date: 00:44:40 02/02/01

Go up one level in this thread


On February 02, 2001 at 03:19:14, Timothy J. Frohlick wrote:

>On February 02, 2001 at 01:28:59, Jouni Uski wrote:
>
>>[D]8/6kn/3B3p/5K1B/8/8/8/8 b - -
>>
>>resign 1-0! Why? Is this really white's win?
>>
>>JouniDate: 1/2/2001
>
>Jouni,
>
>Gambit Tiger without tablebases solves this as a mate in 46 in 26 minutes on a
>PII 333 with 48 Megs Hash.
>
>1... Ng5 2. Bc5 Nf7 3. Bd4+ Kf8 4. Kf6 Ng5 5. Bc5+ Kg8 6. Kf5 Nf7 7. Be7 Ng5 8.
>Bb4 Nf7 9. Kg6 Ne5+ 10. Kf6 Nd7+ 11. Ke7 Ne5 12. Bc3 Nc6+ 13. Ke8 Kh7 14. Kf7
>Ne5+ 15. Kf6 Nc6 16. Bf3 Nd8 17. Bb4 h5 18. Be4+ Kh8 19. Be7 Nc6 20. Bxc6

This shorter mate requires delaying this capture (which would put the position
in the 5 man tablebases) until the 39th ply, deeper than Crafty could see in
the time I gave it.

>Kh7
>21. Be4+ Kg8 22. Kg6 Kh8 23. Bd5 h4 24. Bf6#
>
>
>1-0
>
>Maybe tablebases are not all that great after all.  They don't always find the
>shortest solution to a problem.

With tablebases, GT would announce the longer mate too, until it saw shorter
mates made possible by delaying that capture. Tablebases would get you those
mate scores at faster time controls.

>
>Tim Frohlick



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.