Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: type qualifiers

Author: Daniel Clausen

Date: 08:33:53 09/16/03

Go up one level in this thread


On September 16, 2003 at 10:56:49, Anthony Cozzie wrote:

>I am in the process of restructuring Zappa's datatypes, moving from
>
>Search(varlist) {
>  local_decls;
>  .....
>
>to Search(RecursionBlock *rb) {
>  ....
>
>where a RecursionBlock holds all the information that used to be local.
>
>I think there are 3 advantages to this:
>
>1. Converting to an iterative search would be much easier.

True. And I assume that's your main goal?


>2. All data is accessible at any time/place in the search.

Funny. I would have listed that under "disadvantages". :)


>3. Much less parameter passing is going on.

Do you have that many parameters to pass? The number in my case is very low,
because it's "structured" in structures/classes.

Sargon



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.