Author: Uri Blass
Date: 18:39:56 04/09/04
Go up one level in this thread
On April 09, 2004 at 15:47:30, Uri Blass wrote: >I understand that you use non recursive search in Rebel and I asked some >question that you did not reply until now > >see >http://www.talkchess.com/forums/1/message.html?359230 > >I have another question >You claim that you call search only once. > >My question is if your search get parameters and what parameters does it get. >Does it get initial depth when you have some iterate function that calls search >again and again with increased depth? I guess that you get also initial values of alpha and beta in your search and you start your search with ab[1]=alpha; ab[0]=beta; I am clearly not sure if I understood your code correctly. You did not explain if depth is the remaining depth or the distance from the root. you posted ab[depth]=alpha ab[depth-1]=beta The problem is that you did not explain what is depth when you start the search. It seemed to me that you use the word depth for what I use the word ply but I am not sure. Suppose that you want to search the opening position to depth 10 and you call search. 1)What is depth in the beginning of the search. Is it 1 or 10 or something else? 2)Is depth change every time that the side to move is changed? (for me ply is changed every time the side to move is changed and not depth) 3)You said when I am on ply-3 in the search depth=3 Did you mean ply minus 3? Uri
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.