HCha/Stockfish
1
0
Fork 0
mirror of https://github.com/HChaZZY/Stockfish.git synced 2025-12-24 02:57:11 +08:00
Code Issues Packages Projects Releases Wiki Activity

コンパイルエラーを修正した

Browse Source
This commit is contained in:
nodchip
2020-06-08 23:46:06 +09:00
parent 5c936572e9
commit 33772a0418
4 changed files with 29 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
src/search.cpp
View File

@@ -2024,9 +2024,9 @@ namespace Learner
{
auto th = pos.this_thread();
th->completedDepth = DEPTH_ZERO;
th->completedDepth = 0;
th->selDepth = 0;
th->rootDepth = DEPTH_ZERO;
th->rootDepth = 0;
// <20>T<EFBFBD><54><EFBFBD>m<EFBFBD>[<5B>h<EFBFBD><68><EFBFBD>̃[<5B><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
th->nodes = 0;
@@ -2050,7 +2050,7 @@ namespace Learner
: -make_score(ct, ct / 2));
for (int i = 7; i > 0; i--)
(ss - i)->continuationHistory = &th->continuationHistory[NO_PIECE][0]; // Use as sentinel
(ss - i)->continuationHistory = &th->continuationHistory[0][0][NO_PIECE][0]; // Use as a sentinel
// rootMoves<65>̐ݒ<CC90>
auto& rootMoves = th->rootMoves;
@@ -2109,7 +2109,7 @@ namespace Learner
return { mated_in(/*ss->ply*/ 0 + 1), {} };
}
auto bestValue = ::qsearch<PV>(pos, ss, -VALUE_INFINITE, VALUE_INFINITE, DEPTH_ZERO);
auto bestValue = ::qsearch<PV>(pos, ss, -VALUE_INFINITE, VALUE_INFINITE, 0);
// <20><><EFBFBD><EFBFBD><EFBFBD>ꂽPV<50><56><EFBFBD>Ԃ<EFBFBD><D482>B
std::vector<Move> pvs;
@@ -2139,11 +2139,11 @@ namespace Learner
{
std::vector<Move> pvs;
Depth depth = depth_ * ONE_PLY;
if (depth < DEPTH_ZERO)
Depth depth = depth_;
if (depth < 0)
return std::pair<Value, std::vector<Move>>(Eval::evaluate(pos), std::vector<Move>());
if (depth == DEPTH_ZERO)
if (depth == 0)
return qsearch(pos);
Stack stack[MAX_PLY + 10], * ss = stack + 7;
@@ -2176,7 +2176,7 @@ namespace Learner
Value delta = -VALUE_INFINITE;
Value bestValue = -VALUE_INFINITE;
while ((rootDepth += ONE_PLY) <= depth
while ((rootDepth += 1) <= depth
// node<64><65><EFBFBD><EFBFBD><EFBFBD>𒴂<EFBFBD><F092B482><EFBFBD><EFBFBD>ꍇ<EFBFBD><EA8D87><EFBFBD><EFBFBD><EFBFBD>̃<EFBFBD><CC83>[<5B>v<EFBFBD>𔲂<EFBFBD><F094B282><EFBFBD>
// <20>T<EFBFBD><54><EFBFBD>m<EFBFBD>[<5B>h<EFBFBD><68><EFBFBD>́A<CD81><41><EFBFBD>̊֐<CC8A><D690>̈<EFBFBD><CC88><EFBFBD><EFBFBD>œn<C593><6E><EFBFBD><EFBFBD><EFBFBD>Ă<EFBFBD><C482><EFBFBD><EFBFBD>B
&& !(nodesLimit /*node<64><65><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>*/ && th->nodes.load(std::memory_order_relaxed) >= nodesLimit)
@@ -2203,7 +2203,7 @@ namespace Learner
selDepth = 0;
// depth 5<>ȏ<EFBFBD><C88F>ɂ<EFBFBD><C982><EFBFBD><EFBFBD>Ă<EFBFBD>aspiration search<63>ɐ؂<C990><D882>ւ<EFBFBD><D682><EFBFBD><EFBFBD>B
if (rootDepth >= 5 * ONE_PLY)
if (rootDepth >= 5 * 1)
{
delta = Value(20);
@@ -2217,7 +2217,7 @@ namespace Learner
int failedHighCnt = 0;
while (true)
{
Depth adjustedDepth = std::max(ONE_PLY, rootDepth - failedHighCnt * ONE_PLY);
Depth adjustedDepth = std::max(1, rootDepth - failedHighCnt * 1);
bestValue = ::search<PV>(pos, ss, alpha, beta, adjustedDepth, false);
stable_sort(rootMoves.begin() + pvIdx, rootMoves.end());