Computer Chess Club Archives

Search

Messages

Subject: Re: simple node definitions question

Author: Gerd Isenberg

Date: 02:27:57 09/13/04

Go up one level in this thread

On September 13, 2004 at 00:46:30, Michael Henderson wrote:

>Hello, can anybody confirm these definitions I have for nodes?  I think they are
>right but I like to make sure :)
>
>(depth = 2) //pre frontier node

And additionally

 (depth == 3) //pre pre frontier node

>(depth = 1) //frontier node
>(depth = 0) //leaf node

IMHO each node without any successor is a leaf node, so independent from depth.
The opposite of leaf nodes are interior nodes.
What about horizon-nodes for nodes at depth == 0?

>(depth < 0) //qsearch node

I would define a qsearch node for depth <= 0.

Further node definitions are root-nodes, and minimal game tree node kinds, like
PV-nodes, cut-nodes and all-nodes. I also use most left nodes after each root
move, PV-node or refutation line node.

Gerd

• Re: simple node definitions question Alessandro Scotti 09:55:05 09/13/04
  • Re: simple node definitions question Gerd Isenberg 11:06:16 09/13/04
    • Re: simple node definitions question Alessandro Scotti 01:44:34 09/14/04
• Re: simple node definitions question Uri Blass 02:46:12 09/13/04
  • Re: simple node definitions question Gerd Isenberg 03:24:05 09/13/04
    • Re: simple node definitions question Uri Blass 04:47:53 09/13/04

This page took 0.01 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.