sort.h

超强国际象棋引擎

// sort.h

#ifndef SORT_H

#define SORT_H

// includes

#include "attack.h"

// types

struct sort_t
    {
    int depth;
    int height;
    int trans_killer;
    int killer_1;
    int killer_2;
    int gen;
    int test;
    int pos;
    int value;
    int valuePV;
    int capture_nb;
    board_t *board;
    const attack_t *attack;
    list_t list[1];
    list_t bad[1];
    };

// functions

extern void sort_init(int thread_id);
extern void sort_init(sort_t *sort, board_t *board, const attack_t *attack, int depth, int height, int trans_killer,
    int thread_id);
extern int sort_next(sort_t *sort, int thread_id);
extern void sort_init_qs(sort_t *sort, board_t *board, const attack_t *attack, bool check);
extern int sort_next_qs(sort_t *sort);
extern void good_move(int move, const board_t *board, int depth, int height, int thread_id);
extern void history_good(int move, const board_t *board, int thread_id);
extern void history_bad(int move, const board_t *board, int thread_id);
extern void history_reset(int move, const board_t *board, int thread_id);
extern void note_moves(list_t *list, const board_t *board, int height, int trans_killer, int thread_id);

#endif // !defined SORT_H

// end of sort.h