search_perft.cpp

Go to the documentation of this file.

/*---------------------------------------------------------------------+
 * File: search_perft.cpp
 * Project: part of belofte - A Promising Chess Program
 * Author: yves
 * SPDX-License-Identifier: GPL-2.0-only
+----------------------------------------------------------------------*/
 
#include "belofte.h"
 
//-----------------------------------------------------------------------
 
#if defined(__GNUC__)
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-parameter"
#endif
 
/**
 * Entry point for SearchPerft
 * @param b position
 * @param ml movelist of this position
 */
bScore SearchPerft::CalcBestMove(bBoard& b, bMoveList& ml)
{
  depth_t nDepth = getLevel()->getSearchDepth();
  try {
    if (!nDepth) {
      m_leafnodes = 1LL; // by definition
    } else {
      bBasicBoard newboard(b);
      CalcBestMove(newboard, nDepth);
    }
  } catch (...) { throw; // push other exceptions down
  }
  return SCORE_UNDEFINED;
}
 
#if defined(__GNUC__)
#pragma GCC diagnostic pop
#endif
 
/**
 * Do calculate # nodes from current position
 * @param bb position
 * @param nDepth search for depth x, decreasing !!!
 */
void SearchPerft::CalcBestMove(bBasicBoard& bb, depth_t nDepth)
{
  bMoveList ml;
  ml.clearNeedSorted();
  ml.clearKeepScores();
 
  movenum_t n_moves = ml.generateMoves(bb);
  if (nDepth > 1) {
    --nDepth;
    for (movenum_t moveid = 1; moveid <= n_moves; ++moveid) {
      bMove m(ml[moveid]);
      boardInfo_t bi = bb.applyMove(m);
      CalcBestMove(bb, nDepth);
      bb.unApplyMove(m, bi);
    }
    m_nonleafnodes += n_moves;
  } else {
    m_leafnodes += n_moves;
  }
}
 
//-----------------------------------------------------------------------
 
// eof