Author: Dann Corbit
Date: 14:17:23 09/14/00
Go up one level in this thread
On September 14, 2000 at 16:52:38, Ricardo Gibert wrote: [SNIP] >There is an easy win with 1.Nf6. Of course 1.Qxh6+ mates by force, but I think >that is irrelevant. I'm always satisfied by an easy win (unless there is an easy >mate that costs me little additional effort). > >If you think programs should feature a mate finder mode for problemists, that's >fine, but in a regular chess game, that is not really practical. I do not view >1.Nf6 as a failure to solve the position. A human opponent would probably resign >on the spot against 1.Nf6, so who cares? Your analysis is correct: [D]r1bq1r2/ppp2pkp/3p2nn/2bN2NQ/2B1P3/8/PPp3PP/R1B2R1K w - - acd 12; acn -290540850; ce 657; pv Nf6 Qxf6 Rxf6 Kxf6 Nxh7+ Ke7 Bxh6 Rh8 Bg5+ Kd7 Bxf7 Rxh7 Qxh7 Ne5; pm Nf6; bm Qxh6+; id "BWTC.0134"; But does not answer the question at hand: How hard it is to search 16 plies forward. I picked these two positions because they are interesting *to me* but most of the other positions (in my challenge above) will not be nearly so easy to see any sort of solution. Everyone seems to want to dance out of the way of the real question which I was addressing: "How hard is it to search 16 plies?" So far the only answers I have received are "Who cares -- these are easy mates?" Which (in fact) I obviously knew -- see the thread title! The question I want answered is, "How hard is it to search 16 plies in a busy position?" If someone does not want to try the checkmates, then ignore them and try the others.
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.