Author: Russell Reagan
Date: 20:13:17 12/26/04
Go up one level in this thread
On December 26, 2004 at 22:38:48, Anthony Cozzie wrote:
>IMO, if you are going to do the work of putting everything in stack frames which
>you manage yourself, you have done 90% of the work of getting an iterative
>search. If you get that far, I'll send you my iterative macros and you can
>convert to an iterative search in another 2 hours of work or so. I should warn
>you, however, that by putting everything into shared stack frames, things become
>_even more_ difficult to debug :)
I assumed most chess programmers were using the stack frame concept. Something
like this, or similar:
typedef struct {
Move * move_list;
Move move_played;
Byte castling_rights;
Byte ep_square;
Byte fifty_count;
// etc.
} StackElement;
StackElement stack[STACK_SIZE];
Make/undo update the stack appropriately. Is this what you are talking about, or
something more involved?
I currently do something like my example. I pass search scores around through
the search function parameters, but it doesn't seem like a big task to
incorporate those things into my own stack structure. Do I underestimate the
task?
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.