osl::search::AlphaBeta2Tree< EvalT > メンバ一覧

これは全メンバの一覧です。osl::search::AlphaBeta2Tree< EvalT >継承メンバも含んでいます。
SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability >::abort(Move) constosl::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::Alignmentosl::misc::Align16New [static]
osl::search::AlphaBeta2Common::Alignmentosl::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_updateosl::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_searcherosl::search::SearchState2Core [protected]
checkmate_t typedefosl::search::SearchState2Core
checkmateSearcher() const osl::search::SearchState2Core [inline]
checkPointSearchAllMoves()osl::search::SearchState2 [protected]
common_t typedefosl::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_limitosl::search::SearchState2 [protected]
curDepth() const osl::search::SearchState2Core [inline]
curLimit() const osl::search::SearchState2 [inline]
current_pathosl::search::SearchState2Core [protected]
current_stateosl::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_countosl::search::AlphaBeta2Tree< EvalT > [inline, protected, static]
depth_node_count_quiesceosl::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]
evalosl::search::AlphaBeta2Common< EvalT > [protected]
eval_t typedefosl::search::AlphaBeta2Tree< EvalT >
examineMovesRoot(const MoveLogProbVector &, size_t, Window, MoveLogProb &, int &)osl::search::AlphaBeta2Tree< EvalT > [inline, protected]
extosl::search::AlphaBeta2Tree< EvalT > [protected]
ext_limitosl::search::AlphaBeta2Tree< EvalT > [protected]
FINISH Enum 値osl::search::AlphaBeta2Common< EvalT > [protected]
FixedEval()osl::search::FixedEval [inline, protected]
generatorsosl::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_pvosl::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 typedefosl::search::AlphaBeta2Common< EvalT > [protected]
killersosl::search::AlphaBeta2Common< EvalT > [protected]
last_alpha_updateosl::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_historyosl::search::SearchState2Core [protected]
move_typeosl::search::AlphaBeta2Common< EvalT > [protected]
MoveType Enumosl::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::SearchTimer [inline]
nextMove()osl::search::AlphaBeta2Tree< EvalT > [inline]
NextMove< BLACK > classosl::search::AlphaBeta2Tree< EvalT > [friend]
NextMove< WHITE > classosl::search::AlphaBeta2Tree< EvalT > [friend]
NextQMove< BLACK > classosl::search::AlphaBeta2Tree< EvalT > [friend]
NextQMove< WHITE > classosl::search::AlphaBeta2Tree< EvalT > [friend]
node_countosl::search::AlphaBeta2Tree< EvalT > [protected]
node_typeosl::search::SearchState2Core [protected]
nodeAffordable() const osl::search::SearchTimer [inline]
nodeCount() const osl::search::AlphaBeta2Tree< EvalT > [inline]
NodeType Enumosl::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_countosl::search::AlphaBeta2Common< EvalT > [protected]
path() const osl::search::SearchState2Core [inline]
popPass()osl::search::SearchState2Core [inline]
prediction_for_speculative_searchosl::search::AlphaBeta2Common< EvalT > [protected]
Probabilities_t typedefosl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability >
pushPass()osl::search::SearchState2Core [inline]
pvosl::search::SearchState2Core [protected]
PvNode Enum 値osl::search::SearchState2Core [protected]
PVVector typedefosl::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_stackosl::search::SearchState2Core [protected]
recorderosl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability > [protected]
recordHistory() const osl::search::SearchState2Core [inline]
recordLoseByCheckmate(Player P, SimpleHashRecord *record) constosl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability > [inline]
recordLowerBound(Player P, SimpleHashRecord *record, int limit, const MoveLogProb &best_move, int val) constosl::search::SearchBase< EvalT, SimpleHashTable, CountRecorder, RealizationProbability > [inline]
recordUpperBound(Player P, SimpleHashRecord *record, int limit, const MoveLogProb &best_move, int val) 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::SearchState2Core [protected]
repetitionCounter() const osl::search::SearchState2Core [inline]
ReSearchLimitMarginosl::search::SearchState2 [static]
restoreRootState()osl::search::SearchState2Core
root_depthosl::search::SearchState2Core [protected]
root_ignore_movesosl::search::AlphaBeta2Common< EvalT > [protected]
root_limitosl::search::SearchState2 [protected]
root_stateosl::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]
sharedosl::search::AlphaBeta2Tree< EvalT > [protected]
shared_rootosl::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_treeosl::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]
tableosl::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) constosl::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 typedefosl::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]
 全て クラス ネームスペース ファイル 関数 変数 型定義 列挙型 列挙型の値 フレンド マクロ定義
Sun May 16 09:58:49 2010に生成されました。  doxygen 1.6.3