Author: Jon Dart
Date: 12:18:25 05/15/00
Go up one level in this thread
On May 15, 2000 at 10:28:58, Ernst A. Heinz wrote: >Hi Jon, > >>I looked at Heinz's book but I didn't find his pseudocode (Figure 3.1) >>immediately useful, because it assumes that search() starts with making >>a move, while most people's search() routine will start with move >>generation and will then search the generated moves. > >I do not understand your comment above. Whether the moves are >executed by the caller or the callee in the recursive search >setting is totally irrelevant in this context IMHO. > >Please explain what I may miss? > All I meant was, it wasn't immediately obvious how to move your code around to correspond to the layout of my search routine, and keep the semantics intact. I'm sure it's doable. But I'll have to think about it - which I'll do when I get some rare uninterrupted time to work on it. --Jon
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.