perft.h
Go to the documentation of this file.
1 
11 #ifndef EDAX_PERFT_H
12 #define EDAX_PERFT_H
13 
14 #include <stdbool.h>
15 
16 struct Board;
17 struct Line;
18 void count_games(const struct Board*, const int);
19 void quick_count_games(const struct Board*, const int, const int);
20 void count_positions(const struct Board*, const int, const int);
21 void count_shapes(const struct Board*, const int, const int);
22 void estimate_games(const struct Board*, const long long);
23 void seek_highest_mobility(const struct Board*, const unsigned long long);
24 bool seek_position(const struct Board*, const struct Board*, struct Line*);
25 
27 typedef struct PositionHash {
28  struct PosArray *array;
29  int size;
30  int mask;
31 } PositionHash;
34 bool positionhash_append(PositionHash*, const struct Board*);
35 
36 #endif /* EDAX_PERFT_H */
void positionhash_init(PositionHash *, int)
Initialisation of the hash table.
Definition: perft.c:709
Definition: perft.c:579
void seek_highest_mobility(const struct Board *, const unsigned long long)
Definition: perft.h:27
bool positionhash_append(PositionHash *, const struct Board *)
void estimate_games(const struct Board *, const long long)
Definition: board.h:26
void quick_count_games(const struct Board *, const int, const int)
bool seek_position(const struct Board *, const struct Board *, struct Line *)
void positionhash_delete(PositionHash *)
Free the hash table.
Definition: perft.c:724
void count_shapes(const struct Board *, const int, const int)
int size
Definition: perft.h:29
struct PosArray * array
Definition: perft.h:28
int mask
Definition: perft.h:30
Definition: move.h:35
void count_games(const struct Board *, const int)
void count_positions(const struct Board *, const int, const int)
struct PositionHash PositionHash