#include "MinMaxNodes.h"

Node::Node(Node * _parent)
{
  int x = 0;
  for (x = 0; x < 9; x ++)
  {
    children[x] = 0;
  }
  parent = _parent;
  minScore = VERY_LARGE;
  maxScore = VERY_SMALL;  
  complete = 0;
  xLocation = 0;
  oLocation = 0;

}
Node::~Node()
{
  for (int x = 0; x < 9; x++)
  {
    if (children[x])
    {
      delete children[x];
      children[x] = 0;
    }
  }
}