tree.h

//---------------------------------------------------------------------------
// Tree
//---------------------------------------------------------------------------
#ifndef __TREE_H
#define __TREE_H

#include <vector>
#include <allegro.h>
#include "board.h"

using namespace std;

const float infinity = boardWidth*boardHeight*1000.0;    // vyssi skore nebude


class TreeNode{
protected:
      Board data;
      TreeNode *parent;
          TreeNode *brother;
          TreeNode *child;
          float alpha;
          float beta;
public:

      TreeNode(Board data);

      TreeNode(Board data, TreeNode *parent);

          virtual ~TreeNode();


      Board getData();

      void setData(Board data);

      void addChild(Board data);

      void setBrother(TreeNode *bro){ brother=bro; };


      TreeNode* getBrother();

      TreeNode* getParent();


          TreeNode* getChild();

      void createChilds(int count, Board* data);


      void createChilds(vector<Board> data);


          TreeNode* expand(int no);


          TreeNode* expand(int no, vector<int> &moveAt);


      float minimaxABMin(float a, float b, int no, int level);



          float minimaxABMax(float a, float b, int no, int level);


          float depthSearch(int level, int stopLevel, int no, int moveAt);


};

class AITree{
protected:
      TreeNode* root;
      int countChilds(TreeNode* node);
      int countWidth(TreeNode* node, int grid_space);
      int drawNode(BITMAP *b, TreeNode* node, int off_x, int off_y, int field_width, int grid_space);
public:
      AITree();
      void setRoot(TreeNode* new_root);
      TreeNode* getRoot();
      void draw(BITMAP *b, int filed_width, int grid_space);

          static void show(Board data, unsigned char plNo);
};

void AITree_Test(BITMAP *scr);

#endif // __TREE_H

---