Author: Ed Schröder
Date: 11:36:02 04/10/04
Go up one level in this thread
On April 09, 2004 at 21:39:56, Uri Blass wrote: >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 think it makes little sense to explain how my search exactly works, there are many roads that lead to Rome, meaning in the end they are equal and do the very same. I don't understand how others do it calling search or q_search all the time, it looks time consuming if you ask me, I also don't understand how one can work with only one alpha and one beta while these are ply based. But I assume that in practice all is the very same and I never bothered about it. To explain how I do it I first must understand how you do it otherwise we end up in a Babel-like confusion as we already seem to have now. Ed
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.