Author: Georg v. Zimmermann
Date: 07:47:40 05/31/00
Go up one level in this thread
On May 31, 2000 at 09:32:44, Ulrich Tuerke wrote: >On May 31, 2000 at 09:00:46, Georg v. Zimmermann wrote: > >>Lets assume you know beforehand what move your program will choose, in every >>position. This does not have to be the best move. >> >>You now extend on that move. Will that make your program stronger ? >> >>If yes, lets assume your program likes to move with its knights a lot. Will you >>make it stronger by extending on knight moves ? > >I think that the opposite is true. Your program will extend uninteresting moves >on cost of the remaining moves. The reached search depth will suffer >correspondingly (assuming that you have some time limit for the search). > >I'm not sure if i got you right ? > Why "uninteresting" ? If thats the move its going to choose anyway, it sure wasn't uninteresting ! If half of its moves were knight-moves, then that does mean that it considers knight-moves "interesting". >Regards, Uli
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.