Bruno Raoult
0ff41c408b
- hist.c: add hist_next() - get next entry in history - state_t: remove plycount, clock_50 -> ply50, add phase, repcount - pos_t: add plycount, plyroot - state_t moved to chessdefs.h - perft-test: split perft from do_perft (todo for perft_alt) - position.c: add pos_repcount() - search.c: add is_draw() - uci: set root position (after moves), adjust history moves repcount
121 lines
3.1 KiB
C
121 lines
3.1 KiB
C
/* eval.c - static position evaluation.
|
|
*
|
|
* Copyright (C) 2021-2024 Bruno Raoult ("br")
|
|
* Licensed under the GNU General Public License v3.0 or later.
|
|
* Some rights reserved. See COPYING.
|
|
*
|
|
* You should have received a copy of the GNU General Public License along with this
|
|
* program. If not, see <https://www.gnu.org/licenses/gpl-3.0-standalone.html>.
|
|
*
|
|
* SPDX-License-Identifier: GPL-3.0-or-later <https://spdx.org/licenses/GPL-3.0-or-later.html>
|
|
*
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <brlib.h>
|
|
|
|
#include "chessdefs.h"
|
|
#include "position.h"
|
|
#include "eval.h"
|
|
#include "eval-simple.h"
|
|
|
|
/**
|
|
* calc_phase - calculate position phase
|
|
* @pos: &position
|
|
*
|
|
* This function should be calculated when a new position is setup, or as
|
|
* a verification of an incremental one.
|
|
* phase is clamped between 0 (opening) and 24 (ending).
|
|
*
|
|
* @return:
|
|
*/
|
|
phase_t calc_phase(pos_t *pos)
|
|
{
|
|
int phase = ALL_PHASE;
|
|
phase -= P_PHASE * popcount64(pos->bb[WHITE][PAWN] | pos->bb[BLACK][PAWN]);
|
|
phase -= N_PHASE * popcount64(pos->bb[WHITE][KNIGHT] | pos->bb[BLACK][KNIGHT]);
|
|
phase -= B_PHASE * popcount64(pos->bb[WHITE][BISHOP] | pos->bb[BLACK][BISHOP]);
|
|
phase -= R_PHASE * popcount64(pos->bb[WHITE][ROOK] | pos->bb[BLACK][ROOK]);
|
|
phase -= Q_PHASE * popcount64(pos->bb[WHITE][QUEEN] | pos->bb[BLACK][QUEEN]);
|
|
|
|
phase = max(phase, 0);
|
|
# ifdef DEBUG_EVAL
|
|
printf("calc phase:%d\n", phase);
|
|
# endif
|
|
return phase;
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
* inline eval_t eval_mobility(pos_t *pos, bool color)
|
|
* {
|
|
* return pos->mobility[color];
|
|
* }
|
|
*
|
|
*
|
|
* inline eval_t eval_square_control(pos_t *pos, bool color)
|
|
* {
|
|
* return popcount64(pos->controlled[color]);
|
|
* }
|
|
*/
|
|
|
|
/*
|
|
* inline eval_t eval_mobility(pos_t *pos, bool color)
|
|
* {
|
|
* return pos->mobility[color];
|
|
* }
|
|
*
|
|
*
|
|
* inline eval_t eval_square_control(pos_t *pos, bool color)
|
|
* {
|
|
* return popcount64(pos->controlled[color]);
|
|
* }
|
|
*/
|
|
|
|
eval_t eval(pos_t *pos)
|
|
{
|
|
//eval_t simple = 0, control[2] = {0};
|
|
eval_t simple = 0;
|
|
|
|
//if (pos->eval != EVAL_INVALID)
|
|
// return pos->eval;
|
|
|
|
/* 1) pieces value */
|
|
//material[WHITE] = eval_material(pos, WHITE);
|
|
//material[BLACK] = eval_material(pos, BLACK);
|
|
simple = eval_simple(pos);
|
|
|
|
# ifdef DEBUG_EVAL2
|
|
log_f(2, "eval_simple=%d\n", simple);
|
|
# endif
|
|
|
|
/* 2) square control: 10 square controls diff = 1 pawn */
|
|
//control[WHITE] = eval_square_control(pos, WHITE);
|
|
//control[BLACK] = eval_square_control(pos, BLACK);
|
|
|
|
# ifdef DEBUG_EVAL2
|
|
log_f(2, "square control: W:%d B:%d diff=%d\n",
|
|
control[WHITE], control[BLACK],
|
|
(control[WHITE] - control[BLACK]) * 10);
|
|
# endif
|
|
|
|
/* 3) mobility: 10 mobility diff = 1 pawn
|
|
*/
|
|
# ifdef DEBUG_EVAL2
|
|
log_f(2, "mobility: W:%u B:%u diff=%d\n",
|
|
pos->mobility[WHITE], pos->mobility[BLACK],
|
|
(pos->mobility[WHITE] - pos->mobility[BLACK]) * 10);
|
|
# endif
|
|
|
|
//eval_t res = simple +
|
|
// (control[WHITE] - control[BLACK]) * 10 +
|
|
// (pos->mobility[WHITE] - pos->mobility[BLACK]) * 10;
|
|
# ifdef DEBUG_EVAL2
|
|
log_f(2, "eval: %d\n", res);
|
|
# endif
|
|
pos->eval = simple;
|
|
return simple;
|
|
}
|