Author: Robert Hyatt
Date: 18:42:53 05/22/00
Go up one level in this thread
On May 22, 2000 at 15:26:40, blass uri wrote: >On May 22, 2000 at 13:17:11, Robert Hyatt wrote: ><snipped> >>Yes, but you are talking about two totally different things. (a) how _you_ >>used a computer to figure this out; (b) how a computer would figure this out >>on its own. (b) is _far_ more difficult than (a) to pull off... > >computer can do the same thing that I did if people write the right program. That's too easy a cop-out. A computer _could_ play chess just like you do too, but so far, no one has managed anything like that at all... > > ><snipped> >>The search for this position is shallower than the DB position. After 10-15 >>moves, it is over, completely... While the DB position still has some difficult >>to find lines in it. > >The number of moves is not the point. > >A not quiet line with 60 plies can be more easy to find than a quiet line with >20 plies. > >Uri A not-quiet line 60 moves deep with a single quiet move out at depth=40 is incredibly hard to find for a program..
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.