Author: Robert Hyatt
Date: 10:11:38 09/13/04
Go up one level in this thread
On September 13, 2004 at 10:59:43, Gerd Isenberg wrote: >On September 13, 2004 at 10:13:27, Robert Hyatt wrote: > >>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 >>>(depth = 1) //frontier node >>>(depth = 0) //leaf node >>>(depth < 0) //qsearch node >> >> >>Most use: >> >>depth == 1 pre-frontier node >>depth == 0 frontier node > >According to Heinz, frontier nodes have depth == 1. >He calls depth == 0 nodes horizon nodes. I've only seen the usage I gave. I particularly don't like the term "horizon node" as horizon is something you can't see beyond, yet clearly the q-search probes past those... > >http://supertech.lcs.mit.edu/~heinz/dt/node22.html >http://supertech.lcs.mit.edu/~heinz/dt/node25.html >http://supertech.lcs.mit.edu/~heinz/dt/node28.html > > > >>leaf node is any node with _no_ successors searched. >>depth <= 0 == qsearch
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.