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"
 
//-----------------------------------------------------------------------
 
SearchPerft::SearchPerft()
  : bSearchAlgorithm("Perft")
{
}
 
SearchPerft::~SearchPerft()
{
}
 
bScore SearchPerft::CalcBestMove(bBoard& b)
{
  try {
    if (getLevel()->getSearchDepth() == 0) {
      m_nodes = 1LL; // by definition
    } else {
      CalcBestMove(b, getLevel()->getSearchDepth());
    }
  } catch (...) { throw; // push other exceptions down
  }
  return SCORE_UNDEFINED;
}
 
/** Do calculate # nodes from current position
 * @param b position
 * @param nDepth search for depth x, decreasing !!!
 */
void SearchPerft::CalcBestMove(bBoard& b, depth_t const nDepth)
{
  bMoveList ml(b);
 
  movenum_t n_moves = ml.getNumberOfMoves();
  if (nDepth > 1) {
    for (movenum_t moveid = 1; moveid <= n_moves; moveid++) {
      bMove m(ml[moveid]);
      bBoard newboard(b, const_cast<bMove const&>(m));
      CalcBestMove(newboard, nDepth - 1);
    }
    m_nonleafnodes += n_moves;
  } else {
    m_nodes += n_moves;
  }
}
 
//-----------------------------------------------------------------------
 
// eof