Author: Heiner Marxen
Date: 08:04:54 02/14/00
Go up one level in this thread
On February 13, 2000 at 18:02:20, James T. Walker wrote: >On February 12, 2000 at 10:18:44, leonid wrote: > >>Hello! >> >>Please give your position that contain mate between 4 and 8 moves. Would like to >>know the speed at which usually logic solve mates. I did this four years ago, >>but then I was alone. Now data could be more diversified and useful for me as >>for somebody else. >> >>Until now positions presented here were almost all the time beyond 9 moves (18 >>plies). This make solution too long to find. >> >>Please indicate your hardware and your game. >> >>I will give, for start, one very simple position that contain mate in 6 moves. >>White to go. >> >>/1q2kr2/rB2bbp1/3p1n2/1NpP2BN/P4P1p/1P2Q3/6PP/R3K2R/ White to go. >> >>Thanks for your next position! >>Leonid. > >This is from George Koltanowski's book "TV Chess". It is a mate in 10 with 4 >underpromotions to a Knight. It is one of my favorites. I was surprised to >find in the late 80's that the Fidelity Champion Sensory Challenger would solve >this problem in about 42 seconds. Todays programs will solve this in less than >1 second. > >[D]7K/P1p1p1p1/2P1P1Pk/6pP/3p2P1/1P6/3P4/8 w - - 0 1 Hey, that one is beautiful! But also very easy for a chess program, because of the hard to avoid stalemates. Chest on P/133 with 10 MB hash uses 0.06 seconds (and not more than 1003 moves/nodes) to find a8=N d3 Nb6 cxb6 c7 b5 c8=N b4 Nd6 exd6 e7 d5 e8=N d4 Nf6 gxf6 g7 f5 g8=N# Other programs will also find this one easy. >Jim Walker Thanks! Heiner
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.