Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Search tree vs. recursion

Author: Tom Kerrigan

Date: 02:20:22 11/27/01

Go up one level in this thread


On November 27, 2001 at 03:39:41, Russell Reagan wrote:

>On November 27, 2001 at 02:48:15, Tom Kerrigan wrote:
>
>>What is your incentive for keeping track of the tree data? What would you use it
>>for?
>>
>>-Tom
>
>I have lots of ideas :) Although there's probably a simpler way of keeping track
>of what I want to keep track of. Keeping track of the tree was just the simplest
>way, even though it uses tons of memory (I think, you didn't address that).

Yes, it will use a ton of memory. IIRC, Cheiron does some sort of search that
requires tree information like this. You can look that up. The author is Ulf
Lorenz (IIRC, again).

-Tom



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.