Author: Tim Foden
Date: 02:32:39 05/16/03
Go up one level in this thread
On May 16, 2003 at 04:55:59, Alvaro Jose Povoa Cardoso wrote: >One aspect of the Wu-Beal algorithm is that it goes into a loop controlled by >the depth to win/lose, let's say we use the variable n to that purpose. >To make it short, they use 'win in n' and 'lose in n' operations. >Now, how can that be, since winning positions have odd values and lost positions >have even values? >Can someone please explain this? > >Thanks, >Alvaro Cardoso It is 'win in n moves', not 'win in n ply'. So for 'win in n' the number of ply = 2 * n + 1 (which is odd) For 'lose in n' the number of ply = 2 * n (which is even) Cheers, Tim.
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.