Author: Kolss
Date: 05:21:27 03/26/03
Go up one level in this thread
On March 26, 2003 at 06:08:08, Uri Blass wrote: >On March 26, 2003 at 05:36:25, Uri Blass wrote: > >>On March 26, 2003 at 04:49:19, Jouni Uski wrote: >> >>>With current hardware and excellent programs almost all test positions posted >>>here are solved by some programs - and in many cases stunningly fast even if >>>original poster says something like "impossible" or "very difficult". >>>My question: is it still possible to find test positions which no program is >>>able >>>to solve in lets say 60 minutes?! Let's forget Nolot positions and collect at >>>least >>>30 new "unsolvable by 2003" positions. >>> >>>Jouni >> >>Of course there are positions that no program can solve in an hour. >> >>The question is what do you mean when you say unsolvable by 2003. >> >>If the positions can be taken from previous years then I think that there should >>be no problem to find them. >> >>You can take studies and I suspect that it is possible that no chess playing >>program is able to solve one of my studies in an hour and you will have no >>problem to find 30 problems composed by humans when no program can solve them in >>an hour. >> >>Uri > >Here is a study that I composed and a test position from it(I posted the study >in the past). >I am not sure if playing programs will be able to find 5.Qf1+ in the study >in 1 hour but it is even harder to see the forced mate from the root position >(black says mate in 17 against itself). > >If a program can say mate for white in the root position it will >be impressive. >programs may find the right moves in the first plies without seeing the mate >so they are not good test positions but you need to see the mate in order to >find Qf1+. > >[Event "?"] >[Site "?"] >[Date "????.??.??"] >[Round "?"] >[White "study3"] >[Black "?"] >[Result "1-0"] >[SetUp "1"] >[FEN "8/p2q4/4pQ2/p2p4/p1pQ1K2/2p2b2/1N1N1n1p/2B4k b - - 0 1"] >[PlyCount "34"] > >1... e5+ 2. Kxf3 Qh3+ 3. Kxf2 Qg2+ 4. Ke1 exd4 5. Qf1+ Qxf1+ 6. Kxf1 cxb2 7. >Bxb2 c3 8. Nb1 cxb2 9. Kf2 a3 10. Nxa3 a4 11. Nb1 a3 12. Nxa3 d3 13. Nb1 a5 14. >Nd2 b1=R 15. Nxb1 a4 16. Nd2 a3 17. Nf1 a2 18. Ng3# 1-0 > >[D]8/p7/5Q2/p2p4/p1pp4/2p5/1N1N2qp/2B1K2k w - - 0 5 bm Qf1+ > >Uri Hi Uri, With going into the forced line and then taking back moves (I did not want to invest the time to let my program analyze at the root position), I get a mate in 14 at the root for Qf1+. Best regards, Munjong.
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.