Author: Robert Hyatt
Date: 10:31:22 07/11/98
Go up one level in this thread
On July 11, 1998 at 11:45:25, blass uri wrote: >I am interested in positions only one program can solve > >Vincent Diepeveen posted on June 29 the following 2 positions >r4rk1/pp1n1p1p/1nqP2p1/2b1P1B1/4NQ2/1B3P2/PP2K2P/2R5 w - - bm > >the solution is Rxc5 and diep found the move after 6:42 >and found the advamtage for white after 13:14 >he used 60MB hash tables >and I think he used pentium200MMX >my programs found only Bf6 with draw. > >can another program solve this position in 1 hour? > >the second position: >r1b2rk1/1p1nbppp/pq1p4/3B4/P2NP3/2N1p3/1PP3PP/R2Q1R1K w - - bm Rxf7 >diep found the move after 22 minutes and 43 seconds > >can another program find this move in 1 hour? > >(according to Robert hyatt deep thought solved the position after 2 minutes but >I cannot buy deep thought so it is not important for me) > >in Rebel's homepage there is mate in 30 Rebel can find(all the moves of the >loser are forced). > >can another chess program find the mate? > the mate is trivial. Crafty has a problem with it because I cut the search off at 60 plies, so that it just gets confused. This position came up last year. Changing this limit to 64 makes the mate trivial to find, but I have never seen such a position in a real game and don't give it a lot of thought, as chasing checks that far is probably a huge waste of time anyway... >does someone know about other positions only one program can solve? > >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.