All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
osl::search::AlphaBeta2Tree< EvalT > Member List

This is the complete list of members for osl::search::AlphaBeta2Tree< EvalT >, including all inherited members.

SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability >::abort(Move) constosl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability >inlinevirtual
osl::search::SearchState2::abort(Move) const osl::search::SearchState2virtual
osl::search::SearchState2Core::abort() const osl::search::SearchState2Core
addLimit(int limit)osl::search::SearchState2inlineprotected
addMonitor(const boost::shared_ptr< SearchMonitor > &)osl::search::SearchTimer
addMultiPV(Player P, int, Move)osl::search::AlphaBeta2Tree< EvalT >protected
adjustMemoryUseLimit(double scale=0.9)osl::search::SearchTimerstatic
ALL enum valueosl::search::AlphaBeta2Common< EvalT >protected
AllNode enum valueosl::search::SearchState2Coreprotected
alloc()osl::search::AlphaBeta2Tree< EvalT >protectedstatic
alpha_updateosl::search::AlphaBeta2Tree< EvalT >protected
AlphaBeta2Common(const NumEffectState &s)osl::search::AlphaBeta2Common< EvalT >inlineexplicitprotected
AlphaBeta2Tree(const NumEffectState &s, checkmate_t &checker, SimpleHashTable *t, CountRecorder &)osl::search::AlphaBeta2Tree< EvalT >protected
AlphaBeta2Tree(const AlphaBeta2Tree &src, AlphaBeta2Parallel< EvalT > *)osl::search::AlphaBeta2Tree< EvalT >protected
alphaBetaSearch(const MoveLogProb &move, Window window, bool in_pv)osl::search::AlphaBeta2Tree< EvalT >protected
alphaBetaSearchAfterMove(const MoveLogProb &move, Window window, bool in_pv)osl::search::AlphaBeta2Tree< EvalT >protected
bigramKillerMove() const osl::search::SearchState2Coreinline
brinkmatePenalty(Player P, int limit)osl::search::FixedEvalinlineprotectedstatic
checkmate_searcherosl::search::SearchState2Coreprotected
checkmate_t typedefosl::search::SearchState2Core
checkmateSearcher() const osl::search::SearchState2Coreinline
checkPointSearchAllMoves()osl::search::SearchState2protected
common_t typedefosl::search::AlphaBeta2Tree< EvalT >
countCheckAfterThreatmate(Player turn, int depth=1) const osl::search::SearchState2Coreinline
countCheckAfterThreatmateSacrifice(Player turn, int depth=1) const osl::search::SearchState2Coreinline
countSacrificeCheck2(int history_max) const osl::search::SearchState2protected
cur_limitosl::search::SearchState2protected
curDepth() const osl::search::SearchState2Coreinline
curLimit() const osl::search::SearchState2inline
current_pathosl::search::SearchState2Coreprotected
current_stateosl::search::SearchState2Coreprotected
currentHash() const osl::search::SearchState2Coreinline
CutNode enum valueosl::search::SearchState2Coreprotected
dealloc(MoveGenerator *)osl::search::AlphaBeta2Tree< EvalT >protectedstatic
depth_node_countosl::search::AlphaBeta2Tree< EvalT >protectedstatic
depth_node_count_quiesceosl::search::SearchState2Corestatic
doUndoMoveLight(Move move, Function &f)osl::search::SearchState2Coreinline
doUndoMoveOrPass(const HashKey &new_hash, Move move, Function &f)osl::search::SearchState2Coreinline
drawValue() const osl::search::FixedEvalinlineprotected
elapsed(MilliSeconds now) const osl::search::SearchTimerinline
elapsed() const osl::search::SearchTimerinline
evalosl::search::AlphaBeta2Common< EvalT >protected
eval_t typedefosl::search::AlphaBeta2Tree< EvalT >
examineMovesRoot(const MoveLogProbVector &, size_t, Window, MoveLogProb &, int &)osl::search::AlphaBeta2Tree< EvalT >protected
extosl::search::AlphaBeta2Tree< EvalT >protected
ext_limitosl::search::AlphaBeta2Tree< EvalT >protected
FINISH enum valueosl::search::AlphaBeta2Common< EvalT >protected
FixedEval()osl::search::FixedEvalinlineprotected
generatorsosl::search::AlphaBeta2Tree< EvalT >protected
getBigramKillerMoves(MoveVector &moves) const osl::search::SearchState2Coreinline
getKillerMoves(MoveVector &moves) const osl::search::SearchState2Coreinline
HASH enum valueosl::search::AlphaBeta2Common< EvalT >protected
hasLastRecord(unsigned int n=0) const osl::search::SearchState2Coreinline
hasMonitor() const osl::search::SearchTimerinline
hasSchedule() const osl::search::SearchTimerinline
history() const osl::search::SearchState2Coreinline
historyTable()osl::search::SearchState2Coreinline
historyTable() const osl::search::SearchState2Coreinline
in_pvosl::search::AlphaBeta2Common< EvalT >protected
INITIAL enum valueosl::search::AlphaBeta2Common< EvalT >protected
initPV()osl::search::SearchState2Coreinline
isLosingState(int node_limit)osl::search::SearchState2Coreinline
isStable(Player P, int new_value) const osl::search::AlphaBeta2Tree< EvalT >protected
isStableNow() const osl::search::SearchTimerinline
isThreatmateState(int node_limit, Move &threatmate_move, bool=false)osl::search::SearchState2Coreinline
isThreatmateStateShort(int depth, Move &threatmate_move)osl::search::SearchState2Coreinline
isWinningState(checkmate_t &search, NumEffectState &state, const HashKey &key, PathEncoding path, int node_limit, Move &checkmate_move, Move last_move, bool=false)osl::search::SearchState2Coreinlinestatic
isWinningState(checkmate_t &search, NumEffectState &state, const HashKey &key, PathEncoding path, int node_limit, Move &checkmate_move, Move last_move, bool parallel=false)osl::search::SearchState2Coreinlinestatic
isWinningState(int node_limit, Move &checkmate_move, bool parallel=false)osl::search::SearchState2Coreinline
isWinningStateShort(int depth, Move &checkmate_move)osl::search::SearchState2Coreinline
isWinValue(Player P, int val)osl::search::FixedEvalinlineprotectedstatic
KILLER enum valueosl::search::AlphaBeta2Common< EvalT >protected
killer_t typedefosl::search::AlphaBeta2Common< EvalT >protected
killersosl::search::AlphaBeta2Common< EvalT >protected
last_alpha_updateosl::search::AlphaBeta2Tree< EvalT >protected
lastMemoryUseRatio1000() const osl::search::SearchTimerinline
lastMove(int i=1) const osl::search::SearchState2Coreinline
lastRecord(unsigned int n=0)osl::search::SearchState2Coreinline
lastRecord(unsigned int n=0) const osl::search::SearchState2Coreinline
leafLimit()osl::search::AlphaBeta2Common< EvalT >inlineprotectedstatic
makeGenerator()osl::search::AlphaBeta2Tree< EvalT >protected
makeMove(Move move)osl::search::SearchState2Coreinline
makePV(Move m)osl::search::SearchState2Coreinline
makePV(PVVector &parent, Move m, PVVector &pv) const osl::search::SearchState2Core
MaxDepth enum valueosl::search::AlphaBeta2Tree< EvalT >
minusInfty(Player P)osl::search::FixedEvalinlineprotectedstatic
monitors() const osl::search::SearchTimerinline
move_historyosl::search::SearchState2Coreprotected
move_typeosl::search::AlphaBeta2Common< EvalT >protected
MoveType enum nameosl::search::AlphaBeta2Common< EvalT >protected
mpnosl::search::AlphaBeta2Tree< EvalT >protected
mpn_cutosl::search::AlphaBeta2Tree< EvalT >protected
multi_pvosl::search::AlphaBeta2Common< EvalT >protected
nextIterationCoefficient() const osl::search::SearchTimerinline
nextMove()osl::search::AlphaBeta2Tree< EvalT >
nextMove()osl::search::AlphaBeta2Tree< EvalT >
NextMove< BLACK >osl::search::AlphaBeta2Tree< EvalT >friend
NextMove< WHITE >osl::search::AlphaBeta2Tree< EvalT >friend
NextQMove< BLACK >osl::search::AlphaBeta2Tree< EvalT >friend
NextQMove< WHITE >osl::search::AlphaBeta2Tree< EvalT >friend
node_countosl::search::AlphaBeta2Tree< EvalT >protected
node_typeosl::search::SearchState2Coreprotected
nodeAffordable() const osl::search::SearchTimerinline
nodeCount() const osl::search::AlphaBeta2Tree< EvalT >inline
NodeType enum nameosl::search::SearchState2Coreprotected
PASS enum valueosl::search::AlphaBeta2Common< EvalT >protected
pass_countosl::search::AlphaBeta2Common< EvalT >protected
path() const osl::search::SearchState2Coreinline
popPass()osl::search::SearchState2Coreinline
prediction_for_speculative_searchosl::search::AlphaBeta2Common< EvalT >protected
Probabilities_t typedefosl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability >
pushPass()osl::search::SearchState2Coreinline
pvosl::search::SearchState2Coreprotected
PvNode enum valueosl::search::SearchState2Coreprotected
PVVector typedefosl::search::SearchState2Core
quiesce(Window)osl::search::AlphaBeta2Tree< EvalT >protected
quiesce(Window, int depth_left, DualThreatmateState)osl::search::AlphaBeta2Tree< EvalT >protected
quiesceExp(Window)osl::search::AlphaBeta2Tree< EvalT >protected
quiesceRoot(Window, int depth_left, Move &best_move, DualThreatmateState)osl::search::AlphaBeta2Tree< EvalT >protected
quiesceStable(Window)osl::search::AlphaBeta2Tree< EvalT >protected
quiesceWithMove(Move, Window &, int, Move &, int &, const DualThreatmateState &)osl::search::AlphaBeta2Tree< EvalT >protected
record_stackosl::search::SearchState2Coreprotected
recorderosl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability >protected
recordHistory() const osl::search::SearchState2Coreinline
recordLoseByCheckmate(Player P, SimpleHashRecord *record) constosl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability >inline
recordWinByCheckmate(Player P, SimpleHashRecord *record, Move check_move) constosl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability >inline
repetition_counterosl::search::SearchState2Coreprotected
repetitionCounter() const osl::search::SearchState2Coreinline
ReSearchLimitMarginosl::search::SearchState2static
restoreRootState()osl::search::SearchState2Core
root_depthosl::search::SearchState2Coreprotected
root_ignore_movesosl::search::AlphaBeta2Common< EvalT >protected
root_limitosl::search::SearchState2protected
root_stateosl::search::SearchState2Coreprotected
rootAlpha(Player P, int last_value, Progress16 progress)osl::search::AlphaBeta2Tree< EvalT >static
rootLimitBias()osl::search::AlphaBeta2Common< EvalT >inlineprotectedstatic
rootRecord()osl::search::SearchState2Coreinline
rootState() const osl::search::SearchState2Coreinline
searchAllMoves(SimpleHashRecord *, Window w)osl::search::AlphaBeta2Tree< EvalT >protected
searchAllMoves(Move m, int limit_consumption, SimpleHashRecord *, Window w)osl::search::AlphaBeta2Tree< EvalT >protected
SearchBase(CountRecorder &r, SimpleHashTable *t)osl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability >inline
SearchState2(const NumEffectState &s, checkmate_t &checker)osl::search::SearchState2
SearchState2Core(const NumEffectState &s, checkmate_t &checker)osl::search::SearchState2Core
SearchTimer()osl::search::SearchTimerinline
SearchTimer(const SearchTimer &src)osl::search::SearchTimerinline
setBigramKillerMove(const BigramKillerMove &killers)osl::search::SearchState2Core
setCurrentRecord(SimpleHashRecord *r)osl::search::SearchState2Coreinline
setDrawValue(int value)osl::search::FixedEvalinlineprotected
setHistory(const MoveStack &h)osl::search::SearchState2Core
setKillerMove(Move best_move)osl::search::SearchState2inline
setNextIterationCoefficient(double new_value)osl::search::SearchTimerinline
setNodeCountHardLimit(uint64_t new_value)osl::search::SearchTimerinline
setRoot(int limit)osl::search::SearchState2inlineprotected
setRootRecord(SimpleHashRecord *root)osl::search::SearchState2Coreinline
setStable(bool new_stable)osl::search::SearchTimerinline
setStartTime(MilliSeconds start)osl::search::SearchTimerinline
setState(const NumEffectState &s)osl::search::SearchState2virtual
setTimeAssign(const TimeAssigned &a)osl::search::SearchTimerinline
sharedosl::search::AlphaBeta2Tree< EvalT >protected
shared_rootosl::search::AlphaBeta2Tree< EvalT >protected
showFailLow(int result, Move m) const osl::search::AlphaBeta2Tree< EvalT >protected
showPV(std::ostream &, int, Move, char stable) const osl::search::AlphaBeta2Tree< EvalT >private
stableThreshold(Player P, int last_value)osl::search::AlphaBeta2Tree< EvalT >static
startTime() const osl::search::SearchTimerinline
state() const osl::search::SearchState2Coreinline
stop_treeosl::search::SearchState2Core
stopNow()osl::search::SearchTimerinline
stopping() const osl::search::AlphaBeta2Tree< EvalT >inline
stopReason()osl::search::SearchTimerinline
subLimit(int limit)osl::search::SearchState2inlineprotected
tableosl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability >protected
TACTICAL enum valueosl::search::AlphaBeta2Common< EvalT >protected
testStop()osl::search::AlphaBeta2Tree< EvalT >inline
testThreatmate(SimpleHashRecord *record, bool in_pv)osl::search::AlphaBeta2Tree< EvalT >protected
threatmatePenalty(Player P)osl::search::FixedEvalinlineprotectedstatic
throwIfNoMoreTime(uint64_t node_count)osl::search::SearchTimerinline
throwStop()osl::search::AlphaBeta2Tree< EvalT >private
timeAssigned() const osl::search::SearchTimerinline
tryCheckmate(SimpleHashRecord *record, bool in_pv, Move &checkmate_move)osl::search::AlphaBeta2Tree< EvalT >protected
tryCheckmateAgain(SimpleHashRecord *record, Move &checkmate_move, int node_count, int best_value)osl::search::AlphaBeta2Tree< EvalT >protected
tryPass(SimpleHashRecord *record, Player P) const osl::search::AlphaBeta2Tree< EvalT >protected
tryThreatmate() const osl::search::SearchState2Coreinline
updateCheckmateCount()osl::search::AlphaBeta2Tree< EvalT >protected
updateRootPV(Player P, std::ostream &, int, Move)osl::search::AlphaBeta2Tree< EvalT >protected
validTableMove(const NumEffectState &state, const MoveLogProb &move, int limit) constosl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability >inline
winByCheckmate(Player P)osl::search::FixedEvalinlineprotectedstatic
winByFoul(Player P)osl::search::FixedEvalinlineprotectedstatic
winByLoop(Player P)osl::search::FixedEvalinlineprotectedstatic
Window typedefosl::search::AlphaBeta2Tree< EvalT >
windowMax(Player P)osl::search::FixedEvalinlineprotectedstatic
winThreshold(Player P)osl::search::FixedEvalinlineprotectedstatic
~AlphaBeta2Tree()osl::search::AlphaBeta2Tree< EvalT >protected
~FixedEval()osl::search::FixedEvalinlineprotected
~SearchBase()osl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability >inlinevirtual
~SearchState2()osl::search::SearchState2virtual
~SearchState2Core()osl::search::SearchState2Corevirtual
~SearchTimer()osl::search::SearchTimervirtual