Author: Sune Fischer
Date: 13:07:11 03/20/02
Go up one level in this thread
On March 19, 2002 at 14:55:59, Uri Blass wrote: >On March 19, 2002 at 14:43:13, William H Rogers wrote: > >>Even three or four days still will not play to perfection. >>Just look at the numbers 40 to the 30 power will still not give perfection and >>might take years to complete one move. >>But we are working on it. >>Bill > >It is not a proof that perfection is impossible. > >better searching rules(better pruning and extensions) together with better >evaluation may convince programs to find always the best move. > >You do not need to search everything to the end of the game in order to do it >and the question how many plies you need to search is dependent on the >evaluation and on the extensions and the pruning rules. > >Uri Hmm, I think you need to search pretty deeply to find which is best of 1.d4 and 1.e4 :) And you prove nothing with pruning rules and nullmove, only way to be _really sure_ is to do a fullwidth search :( -S.
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.