Belofte version 2.2.0
A promising chess program using the UCI or Winboard interface
search_mm.h
Go to the documentation of this file.
1/*---------------------------------------------------------------------+
2 * File: search_mm.h
3 * Project: part of belofte - A Promising Chess Program
4 * Author: yves
5 * SPDX-License-Identifier: GPL-2.0-only
6+----------------------------------------------------------------------*/
7
8#if !defined(SEARCH_MM_H)
9#define SEARCH_MM_H
10
11//-----------------------------------------------------------------------
12
14protected:
15 explicit SearchMiniMax(std::string const& s)
17 { m_iterativesearch = true; }
18
19public:
20 explicit SearchMiniMax()
21 : bSearchAlgorithm("MiniMax")
22 { m_iterativesearch = true; }
23 ~SearchMiniMax() override
24 {}
25
26 // no copy or move ctor nor assignment defined
27 SearchMiniMax(SearchMiniMax const&) = delete;
31
32protected:
33 bScore CalcBestMove(bBoard& b, bMoveList& ml) override;
35 depth_t const nDepth, bScore const minimizing);
36};
37
38//-----------------------------------------------------------------------
39
40#endif // defined SEARCH_MM_H
41
42// eof
int_fast8_t depth_t
Definition belofte.h:106
SearchMiniMax & operator=(SearchMiniMax const &)=delete
SearchMiniMax & operator=(SearchMiniMax &&)=delete
SearchMiniMax(std::string const &s)
Definition search_mm.h:15
SearchMiniMax(SearchMiniMax &&)=delete
bScore CalcBestMove(bBoard &b, bMoveList &ml) override
Root search for algorithm.
Definition search_mm.cpp:17
SearchMiniMax(SearchMiniMax const &)=delete
~SearchMiniMax() override
Definition search_mm.h:23
board
Definition board.h:45
bool m_iterativesearch
Definition search.h:146
bSearchAlgorithm(std::string const &s)
Definition search.h:93
int16_t bScore
Definition eval.h:11