Author: John Merlino
Date: 10:55:01 12/19/05
Go up one level in this thread
On December 17, 2005 at 23:12:48, William Kerr wrote: >On December 17, 2005 at 15:51:16, K. Burcham wrote: > >> >> >>What is the shortest mate that you know programs cannot find? >>and >>What is the shortest mate you know that most programs take a deep search to >>find? >> >>kburcham > >Here are some. Most if not all are null movers which gives some engines fits. > >Mate in 3 (From Yace programmer) >[D] 8/1B6/8/5p2/8/8/5Qrq/1K1R2bk w - - bm Qa7;id very very tough mate in 3; The great mate-solver, The King, takes 29 seconds to find the right move and announce Mate in 3 on an AMD 2500. >Mate in 4 (Benko's Bafflers # 1097) >[D] 8/3p1p2/5Ppp/K2R2bk/4pPrr/6Pp/4B2P/3N4 w - - bm Nc3; This one is not found in under 5 minutes! Even after forcing 1.Nc3 d6, it still takes over a minute to announce Mate in 3 -- great problem! >Another tough mate in 4 (Benko's Bafflers # 1217) >[D] 5R2/2K5/1pP5/4k2p/3pp3/2p5/B4N1b/n1R1B2b w - - bm Rxc3;id very tough mate in >4 BB # 1217; This one, on the other hand, takes only three seconds. jm
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.