a programmer approached me with a new chess engine of him, which is stronger than OliThink.
Eventually I got some code and took a look into the code:
Code: Select all
int full_check_search(int beta, int depth, int search_parm, int * pv) {
struct undo_t undo[1];
struct list_t moves[32];
struct list_t *last, *moveptr;
int i, move, new_depth, new_value, in_check, best_value, new_pv[256];
struct entry_t * entry;
true_nodes++;
*pv = 0;
for (i = 4; i <= Board->ply_nb; i+= 2) if (Board->stack[Board->sp - i] == Board->key) return 0;
entry = trans_entry + (KEY_INDEX & trans_mask);
Code: Select all
int full_search(int beta, int depth, int search_parm, int * pv)
{ struct moves_info_t moves_info[1];
struct undo_t undo[1];
struct undo_null_t undo_null[1];
int i, value, new_value, turn, move, new_depth, in_check, best_value, moves_cnt, trans_depth;
unsigned __int64 mask;
struct entry_t * entry;
int new_pv[256];
true_nodes++;
*pv = 0;
for (i = 4; i <= Board->ply_nb; i+= 2) if (Board->stack[Board->sp - i] == Board->key) return 0;
entry = trans_entry + (KEY_INDEX & trans_mask);