| SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability >::abort(Move) const | osl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability > | inlinevirtual |
| osl::search::SearchState2::abort(Move) const | osl::search::SearchState2 | virtual |
| osl::search::SearchState2Core::abort() const | osl::search::SearchState2Core | |
| addLimit(int limit) | osl::search::SearchState2 | inlineprotected |
| 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::SearchTimer | static |
| ALL enum value | osl::search::AlphaBeta2Common< EvalT > | protected |
| AllNode enum value | osl::search::SearchState2Core | protected |
| alloc() | osl::search::AlphaBeta2Tree< EvalT > | protectedstatic |
| alpha_update | osl::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::SearchState2Core | inline |
| brinkmatePenalty(Player P, int limit) | osl::search::FixedEval | inlineprotectedstatic |
| checkmate_searcher | osl::search::SearchState2Core | protected |
| checkmate_t typedef | osl::search::SearchState2Core | |
| checkmateSearcher() const | osl::search::SearchState2Core | inline |
| checkPointSearchAllMoves() | osl::search::SearchState2 | protected |
| common_t typedef | osl::search::AlphaBeta2Tree< EvalT > | |
| countCheckAfterThreatmate(Player turn, int depth=1) const | osl::search::SearchState2Core | inline |
| countCheckAfterThreatmateSacrifice(Player turn, int depth=1) const | osl::search::SearchState2Core | inline |
| countSacrificeCheck2(int history_max) const | osl::search::SearchState2 | protected |
| cur_limit | osl::search::SearchState2 | protected |
| curDepth() const | osl::search::SearchState2Core | inline |
| curLimit() const | osl::search::SearchState2 | inline |
| current_path | osl::search::SearchState2Core | protected |
| current_state | osl::search::SearchState2Core | protected |
| currentHash() const | osl::search::SearchState2Core | inline |
| CutNode enum value | osl::search::SearchState2Core | protected |
| dealloc(MoveGenerator *) | osl::search::AlphaBeta2Tree< EvalT > | protectedstatic |
| depth_node_count | osl::search::AlphaBeta2Tree< EvalT > | protectedstatic |
| depth_node_count_quiesce | osl::search::SearchState2Core | static |
| doUndoMoveLight(Move move, Function &f) | osl::search::SearchState2Core | inline |
| doUndoMoveOrPass(const HashKey &new_hash, Move move, Function &f) | osl::search::SearchState2Core | inline |
| drawValue() const | osl::search::FixedEval | inlineprotected |
| elapsed(MilliSeconds now) const | osl::search::SearchTimer | inline |
| elapsed() const | osl::search::SearchTimer | inline |
| eval | osl::search::AlphaBeta2Common< EvalT > | protected |
| eval_t typedef | osl::search::AlphaBeta2Tree< EvalT > | |
| examineMovesRoot(const MoveLogProbVector &, size_t, Window, MoveLogProb &, int &) | osl::search::AlphaBeta2Tree< EvalT > | protected |
| ext | osl::search::AlphaBeta2Tree< EvalT > | protected |
| ext_limit | osl::search::AlphaBeta2Tree< EvalT > | protected |
| FINISH enum value | osl::search::AlphaBeta2Common< EvalT > | protected |
| FixedEval() | osl::search::FixedEval | inlineprotected |
| generators | osl::search::AlphaBeta2Tree< EvalT > | protected |
| getBigramKillerMoves(MoveVector &moves) const | osl::search::SearchState2Core | inline |
| getKillerMoves(MoveVector &moves) const | osl::search::SearchState2Core | inline |
| HASH enum value | osl::search::AlphaBeta2Common< EvalT > | protected |
| hasLastRecord(unsigned int n=0) const | osl::search::SearchState2Core | inline |
| hasMonitor() const | osl::search::SearchTimer | inline |
| hasSchedule() const | osl::search::SearchTimer | inline |
| history() const | osl::search::SearchState2Core | inline |
| historyTable() | osl::search::SearchState2Core | inline |
| historyTable() const | osl::search::SearchState2Core | inline |
| in_pv | osl::search::AlphaBeta2Common< EvalT > | protected |
| INITIAL enum value | osl::search::AlphaBeta2Common< EvalT > | protected |
| initPV() | osl::search::SearchState2Core | inline |
| isLosingState(int node_limit) | osl::search::SearchState2Core | inline |
| isStable(Player P, int new_value) const | osl::search::AlphaBeta2Tree< EvalT > | protected |
| isStableNow() const | osl::search::SearchTimer | inline |
| isThreatmateState(int node_limit, Move &threatmate_move, bool=false) | osl::search::SearchState2Core | inline |
| isThreatmateStateShort(int depth, Move &threatmate_move) | osl::search::SearchState2Core | inline |
| isWinningState(checkmate_t &search, NumEffectState &state, const HashKey &key, PathEncoding path, int node_limit, Move &checkmate_move, Move last_move, bool=false) | osl::search::SearchState2Core | inlinestatic |
| 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::SearchState2Core | inlinestatic |
| isWinningState(int node_limit, Move &checkmate_move, bool parallel=false) | osl::search::SearchState2Core | inline |
| isWinningStateShort(int depth, Move &checkmate_move) | osl::search::SearchState2Core | inline |
| isWinValue(Player P, int val) | osl::search::FixedEval | inlineprotectedstatic |
| KILLER enum value | osl::search::AlphaBeta2Common< EvalT > | protected |
| killer_t typedef | osl::search::AlphaBeta2Common< EvalT > | protected |
| killers | osl::search::AlphaBeta2Common< EvalT > | protected |
| last_alpha_update | osl::search::AlphaBeta2Tree< EvalT > | protected |
| lastMemoryUseRatio1000() const | osl::search::SearchTimer | inline |
| lastMove(int i=1) const | osl::search::SearchState2Core | inline |
| lastRecord(unsigned int n=0) | osl::search::SearchState2Core | inline |
| lastRecord(unsigned int n=0) const | osl::search::SearchState2Core | inline |
| leafLimit() | osl::search::AlphaBeta2Common< EvalT > | inlineprotectedstatic |
| makeGenerator() | osl::search::AlphaBeta2Tree< EvalT > | protected |
| makeMove(Move move) | osl::search::SearchState2Core | inline |
| makePV(Move m) | osl::search::SearchState2Core | inline |
| makePV(PVVector &parent, Move m, PVVector &pv) const | osl::search::SearchState2Core | |
| MaxDepth enum value | osl::search::AlphaBeta2Tree< EvalT > | |
| minusInfty(Player P) | osl::search::FixedEval | inlineprotectedstatic |
| monitors() const | osl::search::SearchTimer | inline |
| move_history | osl::search::SearchState2Core | protected |
| move_type | osl::search::AlphaBeta2Common< EvalT > | protected |
| MoveType enum name | osl::search::AlphaBeta2Common< EvalT > | protected |
| mpn | osl::search::AlphaBeta2Tree< EvalT > | protected |
| mpn_cut | osl::search::AlphaBeta2Tree< EvalT > | protected |
| multi_pv | osl::search::AlphaBeta2Common< EvalT > | protected |
| nextIterationCoefficient() const | osl::search::SearchTimer | inline |
| 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_count | osl::search::AlphaBeta2Tree< EvalT > | protected |
| node_type | osl::search::SearchState2Core | protected |
| nodeAffordable() const | osl::search::SearchTimer | inline |
| nodeCount() const | osl::search::AlphaBeta2Tree< EvalT > | inline |
| NodeType enum name | osl::search::SearchState2Core | protected |
| PASS enum value | osl::search::AlphaBeta2Common< EvalT > | protected |
| pass_count | osl::search::AlphaBeta2Common< EvalT > | protected |
| path() const | osl::search::SearchState2Core | inline |
| popPass() | osl::search::SearchState2Core | inline |
| prediction_for_speculative_search | osl::search::AlphaBeta2Common< EvalT > | protected |
| Probabilities_t typedef | osl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability > | |
| pushPass() | osl::search::SearchState2Core | inline |
| pv | osl::search::SearchState2Core | protected |
| PvNode enum value | osl::search::SearchState2Core | protected |
| PVVector typedef | osl::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_stack | osl::search::SearchState2Core | protected |
| recorder | osl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability > | protected |
| recordHistory() const | osl::search::SearchState2Core | inline |
| recordLoseByCheckmate(Player P, SimpleHashRecord *record) const | osl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability > | inline |
| recordWinByCheckmate(Player P, SimpleHashRecord *record, Move check_move) const | osl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability > | inline |
| repetition_counter | osl::search::SearchState2Core | protected |
| repetitionCounter() const | osl::search::SearchState2Core | inline |
| ReSearchLimitMargin | osl::search::SearchState2 | static |
| restoreRootState() | osl::search::SearchState2Core | |
| root_depth | osl::search::SearchState2Core | protected |
| root_ignore_moves | osl::search::AlphaBeta2Common< EvalT > | protected |
| root_limit | osl::search::SearchState2 | protected |
| root_state | osl::search::SearchState2Core | protected |
| rootAlpha(Player P, int last_value, Progress16 progress) | osl::search::AlphaBeta2Tree< EvalT > | static |
| rootLimitBias() | osl::search::AlphaBeta2Common< EvalT > | inlineprotectedstatic |
| rootRecord() | osl::search::SearchState2Core | inline |
| rootState() const | osl::search::SearchState2Core | inline |
| 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::SearchTimer | inline |
| SearchTimer(const SearchTimer &src) | osl::search::SearchTimer | inline |
| setBigramKillerMove(const BigramKillerMove &killers) | osl::search::SearchState2Core | |
| setCurrentRecord(SimpleHashRecord *r) | osl::search::SearchState2Core | inline |
| setDrawValue(int value) | osl::search::FixedEval | inlineprotected |
| setHistory(const MoveStack &h) | osl::search::SearchState2Core | |
| setKillerMove(Move best_move) | osl::search::SearchState2 | inline |
| setNextIterationCoefficient(double new_value) | osl::search::SearchTimer | inline |
| setNodeCountHardLimit(uint64_t new_value) | osl::search::SearchTimer | inline |
| setRoot(int limit) | osl::search::SearchState2 | inlineprotected |
| setRootRecord(SimpleHashRecord *root) | osl::search::SearchState2Core | inline |
| setStable(bool new_stable) | osl::search::SearchTimer | inline |
| setStartTime(MilliSeconds start) | osl::search::SearchTimer | inline |
| setState(const NumEffectState &s) | osl::search::SearchState2 | virtual |
| setTimeAssign(const TimeAssigned &a) | osl::search::SearchTimer | inline |
| shared | osl::search::AlphaBeta2Tree< EvalT > | protected |
| shared_root | osl::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::SearchTimer | inline |
| state() const | osl::search::SearchState2Core | inline |
| stop_tree | osl::search::SearchState2Core | |
| stopNow() | osl::search::SearchTimer | inline |
| stopping() const | osl::search::AlphaBeta2Tree< EvalT > | inline |
| stopReason() | osl::search::SearchTimer | inline |
| subLimit(int limit) | osl::search::SearchState2 | inlineprotected |
| table | osl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability > | protected |
| TACTICAL enum value | osl::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::FixedEval | inlineprotectedstatic |
| throwIfNoMoreTime(uint64_t node_count) | osl::search::SearchTimer | inline |
| throwStop() | osl::search::AlphaBeta2Tree< EvalT > | private |
| timeAssigned() const | osl::search::SearchTimer | inline |
| 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::SearchState2Core | inline |
| 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) const | osl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability > | inline |
| winByCheckmate(Player P) | osl::search::FixedEval | inlineprotectedstatic |
| winByFoul(Player P) | osl::search::FixedEval | inlineprotectedstatic |
| winByLoop(Player P) | osl::search::FixedEval | inlineprotectedstatic |
| Window typedef | osl::search::AlphaBeta2Tree< EvalT > | |
| windowMax(Player P) | osl::search::FixedEval | inlineprotectedstatic |
| winThreshold(Player P) | osl::search::FixedEval | inlineprotectedstatic |
| ~AlphaBeta2Tree() | osl::search::AlphaBeta2Tree< EvalT > | protected |
| ~FixedEval() | osl::search::FixedEval | inlineprotected |
| ~SearchBase() | osl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability > | inlinevirtual |
| ~SearchState2() | osl::search::SearchState2 | virtual |
| ~SearchState2Core() | osl::search::SearchState2Core | virtual |
| ~SearchTimer() | osl::search::SearchTimer | virtual |