| 
    My Project
    
   | 
 
#include <ybwc.h>
Public Attributes | |
| volatile int | bestmove | 
| volatile int | bestscore | 
| volatile int | alpha | 
| int | beta | 
| bool | pv_node | 
| volatile int | n_slave | 
| volatile bool | stop_point | 
| volatile bool | is_waiting | 
| int | depth | 
| int | height | 
| struct Search * | search | 
| struct Search * | slave [SPLIT_MAX_SLAVES] | 
| struct Node * | parent | 
| struct Move * | move | 
| volatile int | n_moves_done | 
| volatile int | n_moves_todo | 
| volatile bool | is_helping | 
| Task | help [1] | 
| Lock | lock | 
| Condition | cond | 
A Node is a position in the search tree, containing information shared with parallel threads.
| volatile int Node::alpha | 
alpha lower bound
| volatile int Node::bestmove | 
bestmove
| volatile int Node::bestscore | 
bestscore
| int Node::beta | 
beta upper bound (is constant after initialisation)
| Condition Node::cond | 
condition variable
| int Node::depth | 
depth
| int Node::height | 
height
| Task Node::help[1] | 
helper task
| volatile bool Node::is_helping | 
waiting flag
| volatile bool Node::is_waiting | 
waiting flag
| Lock Node::lock | 
mutex
| struct Move* Node::move | 
move to search
| volatile int Node::n_moves_done | 
search done
| volatile int Node::n_moves_todo | 
search todo
| volatile int Node::n_slave | 
number of slaves splitted flag
| struct Node* Node::parent | 
master node
| bool Node::pv_node | 
pv_node
| struct Search* Node::search | 
master search structure
| struct Search* Node::slave[SPLIT_MAX_SLAVES] | 
slave search structure
| volatile bool Node::stop_point | 
stop point flag