Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Non Recursive Search

Author: rasjid chan

Date: 00:39:55 04/16/04

Go up one level in this thread



.... recursion is wrong because we ... duplicate data ... alpha, beta
.. chasing after a mirage...


We only save alpha, beta = -alpha 1 ply down.
This is the stack array I need. But anything may change
as my program is far from final.


typedef struct
{
	char flag;// for "have-a-move", follow-pv, draw, incheck, etc
	char depth;
	short alpha0;
	short alpha;
	short best;
	short score;//eval() for hashing
	unsigned char maxt[2];// hung threat
	short fExt;
	char nullply;
	char n_goodmove;
	U64 kSqDzSv[4];//attack map of king as queen
	U64 phash;
	gen_t *G, *G0, *G9;
	long hashmove;
}stack_t;


Rasjid




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.