Author: Michel Langeveld
Date: 09:31:49 03/14/04
Go up one level in this thread
On March 14, 2004 at 06:58:50, Bert van den Bosch wrote: >I was wondering when you can decide to make a move which was computed at a ply n >alpha beta, knowing that a 'move now' came while searching an n-ply alpha beta. >You can also make the move computed at ply n-1 (the previous alpha beta tree in >the iterative deepening proces), but I guess sometimes you have found a pretty >nice move at the ply n tree. Is it a matter of taste? > >greetings Bert If the 2nd move is stronger as the first move when search N ply I update the move to play. If time is finished and ply N is not totally calculated to the end it knows that the 2nd move is the strongest one.
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.