Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: (EXAMPLE WILD5 POS) How long will your program take to find Nf2+

Author: leonid

Date: 16:44:15 08/27/00

Go up one level in this thread


On August 27, 2000 at 14:06:20, Heiner Marxen wrote:

>On August 27, 2000 at 09:41:32, Michel Langeveld wrote:
>
>>On August 27, 2000 at 08:36:35, Uri Blass wrote:
>>
>>>On August 27, 2000 at 08:19:39, Michel Langeveld wrote:
>>>
>>>>I think the fastest mate-solver is Chest... but what's the fastest mate-finder?
>>>>
>>>>Michel Langeveld
>>>
>>>I think that you should give test positions and everybody can check.
>>>
>>>Uri
>>
>>(mate in 7)
>>1QBK1Q1R/P1PPP2P/6QB/8/4N3/2n4n/p1kpp2p/rqb1qqr1 w - -; bm Nf2+; ce 32754; dm 7;
>>pv Nf2+ Rxg6 Qf5+ Ne4 Qxe4+ Kc3 Bg7+ Rxg7 Qe5+ Kc4 Ba6+ Qb5 Qbxb5#;
>
>Just as a reference point:
>Chest on a K6-3/400 needs 769 seconds (12.8 minutes) to complete that.
>That is much slower than the typical time for a mate finder.
>
>Also, this is not a particularly difficult example:  all moves of white
>are check moves.  Restricting the white side to check moves, only,
>will still find this solution.  The restricted tree is much smaller,
>and the solution will be found very quickly.
>[ That is what leonid calls "quick logic" I believe. ]

Right!

If you could put this position in graphics, it will be very nice.

Thanks!
Leonid.


>OTOH, I suspect this to be a typical example (at least for wild5).
>
>Heiner



This page took 0.04 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.