Author: Uri Blass
Date: 04:28:31 02/14/01
Go up one level in this thread
On February 14, 2001 at 06:58:29, David Dahlem wrote: > >On February 14, 2001 at 06:48:28, Daniel Chancey wrote: > >>Who has a Valentine's Mate for the computers to solve? (a most difficult >>combination or mate to solve!) >> >>Castle2000 > >This is a mate in 50. Don't know how difficult it is for computers. > >[D]k1b5/1pBp1p1p/1P1PpP2/1p4P1/4p3/8/1pK1P3/b7 w - - 0 1 > >Dave White wins by 1.Kb1 e3 2.Bd8 Kb8 3.Be7 4.Bf8 5.Bg7or Bh6 6.Bh6 or Bg7 respectively 7.Bf8 8.Be7 9.Bd8 10.Bc7 11.Bd8...20.Bd8....29.Bd8...37.Bc7 38.Bd8... 46.Bc7 47.g6 48.f7 or gxf7 49.f8R(or f8Q) 50.Rxb(or Qxb)# I guess that if programs use the right selective search then the solution is easy(you need only to prune lines when the white king leaves b1 and lines when the white bishop play different moves then Bc7-d8,Bd8-e7.Be7-f8,Bf8-g7 Bg7-h6,Bg7-f8,Bh6-f8 and lines when white do pawns moves before black plays with the h pawn and lines when white plays pawn moves that are differet than g6,pawn to f7 f7R and prune lines that white does a different move that is not mate after promoting a pawn to a rook. Uri
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.