Author: Sandro Necchi
Date: 12:38:20 10/11/05
Go up one level in this thread
On October 11, 2005 at 14:56:56, chandler yergin wrote: >On October 11, 2005 at 14:35:21, Dan Honeycutt wrote: > >>No but ... >> >>Your link describes how scores are propogated through the tree with a min max >>search. They mention alpha beta pruning at the end, but say nothing about it >>except it's about twice as fast. >> >>The engine displaying a 12/40 search is looking at a tree that is very different >>than the one presented in the link. > > >Yes... I was using a postion from Chessbase > >It was just an example OK, but the correct way to read 12/40 is the following: the average depth is 12 plies, but at least one variation can go up to 40 plies. However not all possible moves and replies are searched at 12 plies as this is an average depth. This means that some moves/variations are searched at much less depth...depending on the program. Unless the outcome is obvious there may be many good moves not searched enough or not evaluated correctly based on limited info/limite knowledge/wrong evaluations/limited depth. There is still a lot of room for improvements... Sandro >> >>Best >>Dan H. > The analysis module window shows everything.. > Especially note all legal psotions are searched
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.