Author: Anthony Cozzie
Date: 08:51:15 09/16/03
Go up one level in this thread
On September 16, 2003 at 11:33:53, Daniel Clausen wrote:
>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?
at some point i want to do a full DTS implementation.
>>2. All data is accessible at any time/place in the search.
>
>Funny. I would have listed that under "disadvantages". :)
you c++ abstraction wussies. IMO, making a chess engine fast is more important
than abstraction. Its not like "int alpha" is going to change its function any
time soon.
>>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.
for example trans_table_lookup() requires, alpha, beta, ply, depth, etc. How do
you get around this? and if you tell me "class RecursionBlock" I *will* smack
you ;)
anthony
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.