Author: Uri Blass
Date: 01:12:00 04/20/01
Go up one level in this thread
On April 19, 2001 at 22:15:04, David Dahlem wrote: >On April 19, 2001 at 21:58:19, Vincent Diepeveen wrote: > >>On April 19, 2001 at 04:52:09, David Dahlem wrote: >> >>>I would like to put together a tough test suite of positions where there is only >>>one move that will win. Any positions with the solution or suggestions on where >>>i might find such positions would be greatly appreciated. >>> >>>Dave >> >>Ah a cool try. the problem is that to make such a testset that >>you can't already use too well known material as that's already >>inside testsets :) >> > >Thanks Vincent >Yes, i'm sure there are lots of positions with only one move that will win >inside current test suites. But i am not expert enough to separate them from >positions with more than one move that will win, if that makes any sense. :-) >Dave There are positions when it is easy to find out that there is only one move to win. You only need to use tablebases to see it. Here are some comlicated positions when there is only one move to win(the positions are not taken from test suites but from studies that I composed when I tried for many hours to prove that my studies are not correct without success): [D]8/p2q4/5Q2/p2pp3/p1pQ1K2/2p2b2/1N1N1n1p/2B4k w - - 0 1 Kxf3 is the only winning move [D]8/p7/5Q2/p2p4/p1pp4/2p5/1N1N2qp/2B1K2k w - - 0 1 Qf1+ is the only winning move for white [D]8/8/3R3N/7k/4p1rN/1Bppppp1/1n2P2p/3R2KQ w - - 0 1 Qxh2 is the only winning move 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.