root/06/devel-old/algos.h

// File: algos.h

//   Copyright (C) 2001-6 Ulrich Goertz (u@g0ertz.de)

//   This is part of Kombilo, a go database program.

//   This program is free software; you can redistribute it and/or modify
//   it under the terms of the GNU General Public License as published by
//   the Free Software Foundation; either version 2 of the License, or
//   (at your option) any later version.

//   This program is distributed in the hope that it will be useful,
//   but WITHOUT ANY WARRANTY; without even the implied warranty of
//   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
//   GNU General Public License for more details.

//   You should have received a copy of the GNU General Public License
//   along with this program (see doc/license.txt); if not, write to the Free Software
//   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
//   The GNU GPL is also currently available at
//   http://www.gnu.org/copyleft/gpl.html

#include "Python.h"

class Algorithm {
 public:
  Algorithm(int bsize);

  void initialize_process();
  void newgame_process();
  void AB_process(int x, int y);
  void AW_process(int x, int y);
  void AE_process(int x, int y, char removed);
  void endOfNode_process();
  void B_process(int counter, int x, int y, PyObject* cap);
  void W_process(int counter, int x, int y, PyObject* cap);
  void branchpoint_process();
  void endOfVariation_process();
  void endgame_process();
  void finalize_process(datap);

  int boardsize;
  static char** filelist;
  PyObject* search(PatternList patternList, PyObject* options, PyObject* gamelist, PyObject* matchlist);
};



class Algo_finalpos : public Algorithm {
 public:
  Algo_finalpos(int bsize);
  ~Algo_finalpos();

  char* finalpos;
  char* fp;
  int fpIndex;
  int finalposIndex;
  int finalposSize;
};

// in x-coord:
const int ENDOFNODE = 128;
const int BRANCHPOINT = 64;
const int ENDOFVARIATION = 32;

// in y-coord
const int REMOVE = 128;
const int BLACK = 64;
const int WHITE = 32;


class Algo_movelist : public Algorithm {
 public:
  Algo_movelist(int bsize);
  ~Algo_movelist();

  vector<char> mainlistArr;
  vector<long> posTable;

  int finalposCSize;
  int finalposCIndex;
  char* finalposC;

  vector<char> movelist;

  int fpCSize;
  int fpCIndex;
  char* fpC;

};


// const int NOT_HASHABLE = MAXINT-1;
// 
// class Algo_hash : public Algorithm {
//  public:
//   Algo_hash(int bsize, plist, char* fname);
//   ~Algo_hash();
// 
//   long compute_hashkey(Pattern pattern, type);
// 
//   hash_global;
//   int gameCtr;
//   branchpoints;
//   poslist;
//   char* filename;
// };
// 
// 
// 
// class UIntervals {
//  public:
//   UIntervals();
// 
//   int first();
//   void append(UIntervals interv);
//   void inters(UIntervals uinterv);
//   int isEmpty();
// 
//   vector<pair<int,int>> data;
// 
// };
// 
// 
// class Algo_intervals : public Algorithm {
//  public:
//   Algo_intervals(int bsize);
//   ~Algo_intervals();
// 
//   vector<long> movesArr;
//   vector<long> moveIntsArr;
// 
//   vector<vector<int>*> moves;
// 
//   int counter;
//   int ignore;
// };
// 
// const int MAXNOMOVES = 16777215;
// const int FLAG_POINTER = 16777216;
// const int FLAG_BLACK = 33554432;
// const int FLAG_WHITE = 67108864;
// 
// 
// const int ALGO_FINALPOS = 1;
// const int ALGO_MOVELIST = 2;
// const int ALGO_HASH_FULL_CORNERS = 4;
// const int ALGO_INTERVALS = 8;
// const int ALGO_HASH_CENTER = 16;
// const int ALGO_HASH_SIDES = 3;
// 
// // list of implemented algorithms
// 
// ALL_ALGOS = { ALGO_FINALPOS: Algo_finalpos,
//               ALGO_MOVELIST: Algo_movelist,
//               ALGO_HASH_FULL_CORNERS: Algo_hash_full_corners,
//               ALGO_INTERVALS: Algo_intervals}
//