Author: leonid
Date: 09:07:58 05/21/03
Go up one level in this thread
On May 20, 2003 at 10:46:39, Art Basham wrote: >If it is so "easy" for computers to solve, >then why has no one posted that their program >announced mate in 10 at move one? >That is what i wanted to know...:-) On Celeron 600Mhz. LLchess mate solver by selective search, 10 moves deep, mate found in 0 seconds. This signify that time is less than 0.055 sec. Actual position have very good branching factor, even for brute force search. By brute force I went only 8 moves deep and it took for program less than 2 minutes to respond. Leonid. >Thanks anyway...! >art > > >On May 19, 2003 at 11:01:52, Roy Eassa wrote: > >>On May 19, 2003 at 10:18:55, Art Basham wrote: >> >>>[D]3r3k/p4Qp1/7p/1b1Bp3/4Pp2/7R/4nqPP/4R2K w - - >>> >>>Nice ending...! See if your best program will ann. mate at move one! >> >> >>I think this is a good position for a HUMAN to test him/herself with. >> >>I think it's too easy for most modern programs/PCs. >> >>I enjoyed solving it myself. :-)
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.