2008-08-31 23:59:13 -06:00
|
|
|
/*
|
2008-10-19 10:56:28 -06:00
|
|
|
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
|
|
|
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
|
2014-01-01 17:48:07 -07:00
|
|
|
Copyright (C) 2008-2014 Marco Costalba, Joona Kiiski, Tord Romstad
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2008-10-19 10:56:28 -06:00
|
|
|
Stockfish is free software: you can redistribute it and/or modify
|
2008-08-31 23:59:13 -06:00
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
|
|
(at your option) any later version.
|
2008-09-06 04:30:07 -06:00
|
|
|
|
2008-10-19 10:56:28 -06:00
|
|
|
Stockfish is distributed in the hope that it will be useful,
|
2008-08-31 23:59:13 -06:00
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
2008-09-06 04:30:07 -06:00
|
|
|
|
2008-08-31 23:59:13 -06:00
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
2008-11-03 14:05:41 -07:00
|
|
|
#include <cstring>
|
2011-01-07 05:00:25 -07:00
|
|
|
#include <iostream>
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2012-07-07 12:30:27 -06:00
|
|
|
#include "bitboard.h"
|
2008-08-31 23:59:13 -06:00
|
|
|
#include "tt.h"
|
|
|
|
|
2011-04-15 10:14:12 -06:00
|
|
|
TranspositionTable TT; // Our global transposition table
|
2008-08-31 23:59:13 -06:00
|
|
|
|
|
|
|
|
2014-02-09 09:31:45 -07:00
|
|
|
/// TranspositionTable::resize() sets the size of the transposition table,
|
2013-02-09 00:17:03 -07:00
|
|
|
/// measured in megabytes. Transposition table consists of a power of 2 number
|
2014-06-28 12:05:58 -06:00
|
|
|
/// of clusters and each cluster consists of TTClusterSize number of TTEntry.
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2014-02-09 09:31:45 -07:00
|
|
|
void TranspositionTable::resize(uint64_t mbSize) {
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2014-06-28 12:05:58 -06:00
|
|
|
assert(msb((mbSize * 1024 * 1024) / sizeof(TTCluster)) < 32);
|
2009-04-27 06:21:49 -06:00
|
|
|
|
2014-06-28 12:05:58 -06:00
|
|
|
uint32_t newClusterCount = 1 << msb((mbSize * 1024 * 1024) / sizeof(TTCluster));
|
2013-02-09 02:22:34 -07:00
|
|
|
|
2014-06-28 12:05:58 -06:00
|
|
|
if (newClusterCount == clusterCount)
|
2011-04-03 02:19:08 -06:00
|
|
|
return;
|
|
|
|
|
2014-06-28 12:05:58 -06:00
|
|
|
clusterCount = newClusterCount;
|
|
|
|
|
2013-05-01 14:55:23 -06:00
|
|
|
free(mem);
|
2014-06-28 12:05:58 -06:00
|
|
|
mem = calloc(clusterCount * sizeof(TTCluster) + CACHE_LINE_SIZE - 1, 1);
|
2013-04-30 00:08:54 -06:00
|
|
|
|
2013-05-01 14:55:23 -06:00
|
|
|
if (!mem)
|
2008-09-06 04:19:29 -06:00
|
|
|
{
|
2011-04-03 02:19:08 -06:00
|
|
|
std::cerr << "Failed to allocate " << mbSize
|
2011-07-02 06:33:06 -06:00
|
|
|
<< "MB for transposition table." << std::endl;
|
2011-04-03 02:19:08 -06:00
|
|
|
exit(EXIT_FAILURE);
|
2008-08-31 23:59:13 -06:00
|
|
|
}
|
2012-07-07 12:30:27 -06:00
|
|
|
|
2014-06-28 12:05:58 -06:00
|
|
|
table = (TTCluster*)((uintptr_t(mem) + CACHE_LINE_SIZE - 1) & ~(CACHE_LINE_SIZE - 1));
|
2008-08-31 23:59:13 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-04-15 10:14:12 -06:00
|
|
|
/// TranspositionTable::clear() overwrites the entire transposition table
|
2009-04-27 06:21:49 -06:00
|
|
|
/// with zeroes. It is called whenever the table is resized, or when the
|
2008-08-31 23:59:13 -06:00
|
|
|
/// user asks the program to clear the table (from the UCI interface).
|
|
|
|
|
|
|
|
void TranspositionTable::clear() {
|
2008-09-06 04:19:29 -06:00
|
|
|
|
2014-06-28 12:05:58 -06:00
|
|
|
std::memset(table, 0, clusterCount * sizeof(TTCluster));
|
2008-08-31 23:59:13 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-06-29 02:23:43 -06:00
|
|
|
/// TranspositionTable::probe() looks up the current position in the
|
|
|
|
/// transposition table. Returns a pointer to the TTEntry or NULL if
|
|
|
|
/// position is not found.
|
|
|
|
|
|
|
|
const TTEntry* TranspositionTable::probe(const Key key) const {
|
|
|
|
|
2014-03-23 02:24:35 -06:00
|
|
|
TTEntry* tte = first_entry(key);
|
2014-06-28 12:05:58 -06:00
|
|
|
uint16_t key16 = key >> 48;
|
2013-06-29 02:23:43 -06:00
|
|
|
|
2014-06-28 12:05:58 -06:00
|
|
|
for (unsigned i = 0; i < TTClusterSize; ++i, ++tte)
|
|
|
|
if (tte->key16 == key16)
|
2014-03-23 02:24:35 -06:00
|
|
|
{
|
2014-06-28 12:05:58 -06:00
|
|
|
tte->genBound8 = generation | tte->bound(); // Refresh
|
2013-06-29 02:23:43 -06:00
|
|
|
return tte;
|
2014-03-23 02:24:35 -06:00
|
|
|
}
|
2013-06-29 02:23:43 -06:00
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-04-15 10:14:12 -06:00
|
|
|
/// TranspositionTable::store() writes a new entry containing position key and
|
|
|
|
/// valuable information of current position. The lowest order bits of position
|
2013-12-02 11:04:09 -07:00
|
|
|
/// key are used to decide in which cluster the position will be placed.
|
|
|
|
/// When a new entry is written and there are no empty entries available in the
|
|
|
|
/// cluster, it replaces the least valuable of the entries. A TTEntry t1 is considered
|
|
|
|
/// to be more valuable than a TTEntry t2 if t1 is from the current search and t2
|
|
|
|
/// is from a previous search, or if the depth of t1 is bigger than the depth of t2.
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2013-11-08 03:42:22 -07:00
|
|
|
void TranspositionTable::store(const Key key, Value v, Bound b, Depth d, Move m, Value statV) {
|
2009-04-27 06:21:49 -06:00
|
|
|
|
2008-08-31 23:59:13 -06:00
|
|
|
TTEntry *tte, *replace;
|
2014-06-28 12:05:58 -06:00
|
|
|
uint16_t key16 = key >> 48; // Use the high 16 bits as key inside the cluster
|
2008-08-31 23:59:13 -06:00
|
|
|
|
2013-02-05 10:02:54 -07:00
|
|
|
tte = replace = first_entry(key);
|
2011-04-15 10:14:12 -06:00
|
|
|
|
2014-06-28 12:05:58 -06:00
|
|
|
for (unsigned i = 0; i < TTClusterSize; ++i, ++tte)
|
2008-09-06 04:19:29 -06:00
|
|
|
{
|
2014-06-28 12:05:58 -06:00
|
|
|
if (!tte->key16 || tte->key16 == key16) // Empty or overwrite old
|
2009-04-27 06:21:49 -06:00
|
|
|
{
|
2013-06-29 02:23:43 -06:00
|
|
|
if (!m)
|
|
|
|
m = tte->move(); // Preserve any existing ttMove
|
2009-04-27 06:21:49 -06:00
|
|
|
|
2013-06-29 02:23:43 -06:00
|
|
|
replace = tte;
|
|
|
|
break;
|
2009-04-27 06:21:49 -06:00
|
|
|
}
|
2010-06-28 01:20:34 -06:00
|
|
|
|
2011-04-15 10:14:12 -06:00
|
|
|
// Implement replace strategy
|
2014-06-28 12:05:58 -06:00
|
|
|
if ( (( tte->genBound8 & 0xFC) == generation || tte->bound() == BOUND_EXACT)
|
|
|
|
- ((replace->genBound8 & 0xFC) == generation)
|
|
|
|
- (tte->depth8 < replace->depth8) < 0)
|
2009-04-27 06:21:49 -06:00
|
|
|
replace = tte;
|
2008-08-31 23:59:13 -06:00
|
|
|
}
|
|
|
|
|
2014-06-28 12:05:58 -06:00
|
|
|
replace->save(key16, v, b, d, m, generation, statV);
|
2008-08-31 23:59:13 -06:00
|
|
|
}
|