Author: Robin Smith
Date: 17:09:58 12/22/04
Go up one level in this thread
On December 22, 2004 at 11:13:06, Uri Zlatnik wrote: >Search extension is a problem. The weakness is that computers never play a move >until the calculate the whole variant. Some people might also say never playing a move until the whole variation is calculated is also a computer's strength. Often they would be right. >Fritz 8 suggests Nd2, a passive move insteed of attacking the kingside with f6 >immediately. It reached a depth of 21/21 after 9.5 hours of thinking and still >couldn't find the best move. This is true. However without calcualting the line to the end how can anyone know that Nd2 is worse? There are nearly identical positions where Nd2 will be best. Only concrete analysis of variations can assure you which position is which. -Robin
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.