Author: William Kerr
Date: 20:23:29 12/17/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; > > >Mate in 4 (Benko's Bafflers # 1097) >[D] 8/3p1p2/5Ppp/K2R2bk/4pPrr/6Pp/4B2P/3N4 w - - bm Nc3; > >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; > >Bill Whoops, The last mate in 4 is actually a mate in 5. I guess thats what made the mate in 4 so tough!! Bill
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.