SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability >::abort(Move) const | osl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability > | [inline, virtual] |
osl::search::SearchState2::abort(Move) const | osl::search::SearchState2 | [virtual] |
osl::search::SearchState2Core::abort() const | osl::search::SearchState2Core | |
addLimit(int limit) | osl::search::SearchState2 | [inline, protected] |
addMonitor(const boost::shared_ptr< SearchMonitor > &) | osl::search::SearchTimer | |
addMultiPV(Player P, int, Move) | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected] |
adjustMemoryUseLimit(double scale=0.9) | osl::search::SearchTimer | [static] |
osl::Alignment | osl::misc::Align16New | [static] |
osl::search::AlphaBeta2Common::Alignment | osl::misc::Align16New | [protected, static] |
ALL Enum 値 | osl::search::AlphaBeta2Common< EvalT > | [protected] |
AllNode Enum 値 | osl::search::SearchState2Core | [protected] |
alloc() | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected, static] |
alpha_update | osl::search::AlphaBeta2Tree< EvalT > | [protected] |
AlphaBeta2Common(const NumEffectState &s) | osl::search::AlphaBeta2Common< EvalT > | [inline, explicit, protected] |
AlphaBeta2Tree(const NumEffectState &s, checkmate_t &checker, SimpleHashTable *t, CountRecorder &) | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected] |
AlphaBeta2Tree(const AlphaBeta2Tree &src, AlphaBeta2Parallel< EvalT > *) | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected] |
alphaBetaSearch(const MoveLogProb &move, Window window, bool in_pv) | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected] |
alphaBetaSearchAfterMove(const MoveLogProb &move, Window window, bool in_pv) | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected] |
bigramKillerMove() const | osl::search::SearchState2Core | [inline] |
brinkmatePenalty(Player P, int limit) | osl::search::FixedEval | [inline, protected, static] |
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 値 | osl::search::SearchState2Core | [protected] |
dealloc(MoveGenerator *) | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected, static] |
depth_node_count | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected, static] |
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 | [inline, protected] |
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 > | [inline, protected] |
ext | osl::search::AlphaBeta2Tree< EvalT > | [protected] |
ext_limit | osl::search::AlphaBeta2Tree< EvalT > | [protected] |
FINISH Enum 値 | osl::search::AlphaBeta2Common< EvalT > | [protected] |
FixedEval() | osl::search::FixedEval | [inline, protected] |
generators | osl::search::AlphaBeta2Tree< EvalT > | [protected] |
getBigramKillerMoves(MoveVector &moves) const | osl::search::SearchState2Core | [inline] |
getKillerMoves(MoveVector &moves) const | osl::search::SearchState2Core | [inline] |
HASH Enum 値 | 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 値 | 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 | [inline, static] |
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 | [inline, static] |
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 | [inline, protected, static] |
KILLER Enum 値 | 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] |
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 > | [inline, protected, static] |
makeGenerator() | osl::search::AlphaBeta2Tree< EvalT > | [inline, 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 値 | osl::search::AlphaBeta2Tree< EvalT > | |
minusInfty(Player P) | osl::search::FixedEval | [inline, protected, static] |
monitors() const | osl::search::SearchTimer | [inline] |
move_history | osl::search::SearchState2Core | [protected] |
move_type | osl::search::AlphaBeta2Common< EvalT > | [protected] |
MoveType Enum | 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 > | [inline] |
NextMove< BLACK > class | osl::search::AlphaBeta2Tree< EvalT > | [friend] |
NextMove< WHITE > class | osl::search::AlphaBeta2Tree< EvalT > | [friend] |
NextQMove< BLACK > class | osl::search::AlphaBeta2Tree< EvalT > | [friend] |
NextQMove< WHITE > class | 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 | osl::search::SearchState2Core | [protected] |
osl::operator delete(void *ptr, size_t size) | osl::misc::Align16New | [static] |
osl::search::AlphaBeta2Common::operator delete(void *ptr, size_t size) | osl::misc::Align16New | [protected, static] |
osl::operator delete[](void *ptr, size_t size) | osl::misc::Align16New | [static] |
osl::search::AlphaBeta2Common::operator delete[](void *ptr, size_t size) | osl::misc::Align16New | [protected, static] |
osl::operator new(size_t size) | osl::misc::Align16New | [static] |
osl::search::AlphaBeta2Common::operator new(size_t size) | osl::misc::Align16New | [protected, static] |
osl::operator new[](size_t size) | osl::misc::Align16New | [static] |
osl::search::AlphaBeta2Common::operator new[](size_t size) | osl::misc::Align16New | [protected, static] |
PASS Enum 値 | 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 値 | osl::search::SearchState2Core | [protected] |
PVVector typedef | osl::search::SearchState2Core | |
quiesce(Window) | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected] |
quiesce(Window, int depth_left, DualThreatmateState) | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected] |
quiesceExp(Window) | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected] |
quiesceRoot(Window, int depth_left, Move &best_move, DualThreatmateState) | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected] |
quiesceStable(Window) | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected] |
quiesceWithMove(Move, Window &, int, Move &, int &, const DualThreatmateState &) | osl::search::AlphaBeta2Tree< EvalT > | [inline, 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] |
recordLowerBound(Player P, SimpleHashRecord *record, int limit, const MoveLogProb &best_move, int val) const | osl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability > | [inline] |
recordUpperBound(Player P, SimpleHashRecord *record, int limit, const MoveLogProb &best_move, int val) 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 > | [inline, static] |
rootLimitBias() | osl::search::AlphaBeta2Common< EvalT > | [inline, protected, static] |
rootRecord() | osl::search::SearchState2Core | [inline] |
rootState() const | osl::search::SearchState2Core | [inline] |
searchAllMoves(SimpleHashRecord *, Window w) | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected] |
searchAllMoves(Move m, int limit_consumption, SimpleHashRecord *, Window w) | osl::search::AlphaBeta2Tree< EvalT > | [inline, 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 | [inline, protected] |
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 | [inline, protected] |
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 > | [inline, protected] |
showPV(std::ostream &, int, Move, char stable) const | osl::search::AlphaBeta2Tree< EvalT > | [inline, private] |
stableThreshold(Player P, int last_value) | osl::search::AlphaBeta2Tree< EvalT > | [inline, 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 | [inline, protected] |
table | osl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability > | [protected] |
TACTICAL Enum 値 | osl::search::AlphaBeta2Common< EvalT > | [protected] |
testStop() | osl::search::AlphaBeta2Tree< EvalT > | [inline] |
testThreatmate(SimpleHashRecord *record, bool in_pv) | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected] |
threatmatePenalty(Player P) | osl::search::FixedEval | [inline, protected, static] |
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 > | [inline, protected] |
tryCheckmateAgain(SimpleHashRecord *record, Move &checkmate_move, int node_count, int best_value) | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected] |
tryPass(SimpleHashRecord *record, Player P) const | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected] |
tryThreatmate() const | osl::search::SearchState2Core | [inline] |
updateCheckmateCount() | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected] |
updateRootPV(Player P, std::ostream &, int, Move) | osl::search::AlphaBeta2Tree< EvalT > | [inline, 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 | [inline, protected, static] |
winByFoul(Player P) | osl::search::FixedEval | [inline, protected, static] |
winByLoop(Player P) | osl::search::FixedEval | [inline, protected, static] |
Window typedef | osl::search::AlphaBeta2Tree< EvalT > | |
windowMax(Player P) | osl::search::FixedEval | [inline, protected, static] |
winThreshold(Player P) | osl::search::FixedEval | [inline, protected, static] |
osl::~Align16New() | osl::misc::Align16New | [inline, protected] |
osl::search::AlphaBeta2Common::~Align16New() | osl::misc::Align16New | [inline, protected] |
~AlphaBeta2Tree() | osl::search::AlphaBeta2Tree< EvalT > | [inline, protected] |
~FixedEval() | osl::search::FixedEval | [inline, protected] |
~SearchBase() | osl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability > | [inline, virtual] |
~SearchState2() | osl::search::SearchState2 | [virtual] |
~SearchState2Core() | osl::search::SearchState2Core | [virtual] |
~SearchTimer() | osl::search::SearchTimer | [virtual] |