X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fvalue.h;h=512cc2f90aef7a8d725782a258922ba40bfd8b81;hp=b5f56c06b7caf0ce0136a42d891f5c17e31d7373;hb=0e800c527a9773ab986e185dae291695a4ca83ee;hpb=5c81602d14539f8259a715477315e28b5de7cb54 diff --git a/src/value.h b/src/value.h index b5f56c06..512cc2f9 100644 --- a/src/value.h +++ b/src/value.h @@ -1,7 +1,7 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2009 Marco Costalba + Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -33,23 +33,62 @@ //// enum ValueType { - VALUE_TYPE_NONE = 0, + VALUE_TYPE_NONE = 0, VALUE_TYPE_UPPER = 1, // Upper bound VALUE_TYPE_LOWER = 2, // Lower bound - VALUE_TYPE_EXACT = 3, // Exact score - VALUE_TYPE_EVAL = 4 // Evaluation cache + VALUE_TYPE_EXACT = VALUE_TYPE_UPPER | VALUE_TYPE_LOWER }; enum Value { - VALUE_DRAW = 0, + VALUE_DRAW = 0, VALUE_KNOWN_WIN = 15000, - VALUE_MATE = 30000, - VALUE_INFINITE = 30001, - VALUE_NONE = 30002 + VALUE_MATE = 30000, + VALUE_INFINITE = 30001, + VALUE_NONE = 30002, + VALUE_ENSURE_SIGNED = -1 }; +enum ScaleFactor { + SCALE_FACTOR_ZERO = 0, + SCALE_FACTOR_NORMAL = 64, + SCALE_FACTOR_MAX = 128, + SCALE_FACTOR_NONE = 255 +}; + + +/// Score enum keeps a midgame and an endgame value in a single +/// integer (enum), first LSB 16 bits are used to store endgame +/// value, while upper bits are used for midgame value. + +// Compiler is free to choose the enum type as long as can keep +// its data, so ensure Score to be an integer type. +enum Score { ENSURE_32_BITS_SIZE_P = (1 << 16), ENSURE_32_BITS_SIZE_N = -(1 << 16)}; + +// Extracting the _signed_ lower and upper 16 bits it not so trivial +// because according to the standard a simple cast to short is +// implementation defined and so is a right shift of a signed integer. +inline Value mg_value(Score s) { return Value(((int(s) + 32768) & ~0xffff) / 0x10000); } + +// Unfortunatly on Intel 64 bit we have a small speed regression, so use a faster code in +// this case, although not 100% standard compliant it seems to work for Intel and MSVC. +#if defined(IS_64BIT) && (!defined(__GNUC__) || defined(__INTEL_COMPILER)) +inline Value eg_value(Score s) { return Value(int16_t(s & 0xffff)); } +#else +inline Value eg_value(Score s) { return Value((int)(unsigned(s) & 0x7fffu) - (int)(unsigned(s) & 0x8000u)); } +#endif + +inline Score make_score(int mg, int eg) { return Score((mg << 16) + eg); } + +// Division must be handled separately for each term +inline Score operator/(Score s, int i) { return make_score(mg_value(s) / i, eg_value(s) / i); } + +// Only declared but not defined. We don't want to multiply two scores due to +// a very high risk of overflow. So user should explicitly convert to integer. +inline Score operator*(Score s1, Score s2); + + //// //// Constants and variables //// @@ -62,16 +101,16 @@ enum Value { /// /// Values modified by Joona Kiiski -const Value PawnValueMidgame = Value(0x0CC); -const Value PawnValueEndgame = Value(0x101); -const Value KnightValueMidgame = Value(0x332); +const Value PawnValueMidgame = Value(0x0C6); +const Value PawnValueEndgame = Value(0x102); +const Value KnightValueMidgame = Value(0x331); const Value KnightValueEndgame = Value(0x34E); -const Value BishopValueMidgame = Value(0x345); -const Value BishopValueEndgame = Value(0x356); -const Value RookValueMidgame = Value(0x4F8); -const Value RookValueEndgame = Value(0x500); -const Value QueenValueMidgame = Value(0x9D5); -const Value QueenValueEndgame = Value(0x9FB); +const Value BishopValueMidgame = Value(0x344); +const Value BishopValueEndgame = Value(0x359); +const Value RookValueMidgame = Value(0x4F6); +const Value RookValueEndgame = Value(0x4FE); +const Value QueenValueMidgame = Value(0x9D9); +const Value QueenValueEndgame = Value(0x9FE); const Value PieceValueMidgame[17] = { Value(0), @@ -93,10 +132,9 @@ const Value PieceValueEndgame[17] = { Value(0), Value(0), Value(0) }; -/// Bonus for having the side to move +/// Bonus for having the side to move (modified by Joona Kiiski) -const Value TempoValueMidgame = Value(48); -const Value TempoValueEndgame = Value(21); +const Score TempoValue = make_score(48, 22); //// @@ -104,29 +142,15 @@ const Value TempoValueEndgame = Value(21); //// inline Value operator+ (Value v, int i) { return Value(int(v) + i); } -inline Value operator+ (Value v1, Value v2) { return Value(int(v1) + int(v2)); } -inline void operator+= (Value &v1, Value v2) { - v1 = Value(int(v1) + int(v2)); -} inline Value operator- (Value v, int i) { return Value(int(v) - i); } -inline Value operator- (Value v) { return Value(-int(v)); } -inline Value operator- (Value v1, Value v2) { return Value(int(v1) - int(v2)); } -inline void operator-= (Value &v1, Value v2) { - v1 = Value(int(v1) - int(v2)); -} -inline Value operator* (Value v, int i) { return Value(int(v) * i); } -inline void operator*= (Value &v, int i) { v = Value(int(v) * i); } -inline Value operator* (int i, Value v) { return Value(int(v) * i); } -inline Value operator/ (Value v, int i) { return Value(int(v) / i); } -inline void operator/= (Value &v, int i) { v = Value(int(v) / i); } inline Value value_mate_in(int ply) { - return Value(VALUE_MATE - Value(ply)); + return VALUE_MATE - ply; } inline Value value_mated_in(int ply) { - return Value(-VALUE_MATE + Value(ply)); + return -VALUE_MATE + ply; } inline bool is_upper_bound(ValueType vt) { @@ -153,16 +177,4 @@ inline Value piece_value_endgame(Piece p) { return PieceValueEndgame[p]; } - -//// -//// Prototypes -//// - -extern Value value_to_tt(Value v, int ply); -extern Value value_from_tt(Value v, int ply); -extern int value_to_centipawns(Value v); -extern Value value_from_centipawns(int cp); -extern const std::string value_to_string(Value v); - - #endif // !defined(VALUE_H_INCLUDED)