| checkmate_t typedef | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | |
| CheckmateSearcher(size_t node_limit) | osl::game_playing::SearchPlayer::CheckmateSearcher | [inline, explicit] |
| disprover_t typedef | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | |
| DualCheckmateSearcher(size_t total_node_limit=CHECKMATE_DEFAULT_TOTAL_NODE_LIMIT) | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | [inline, explicit] |
| getTable(Player P) const | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | [inline] |
| getTable(Player P) | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | [inline] |
| isLosingState(int node_limit, NumEffectState &state, const HashKey &key, const PathEncoding &path, Move last_move=Move::INVALID()) | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | [inline] |
| isLosingState(int node_limit, NumEffectState &state, const HashKey &, const PathEncoding &path, Move last_move=Move::INVALID()) | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | |
| isNotWinningStateByOracle(NumEffectState &state, const HashKey &key, const PathEncoding &path, unsigned short &oracle_age) | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | [inline] |
| isWinningState(int node_limit, NumEffectState &state, const HashKey &key, const PathEncoding &path, Move &best_move, AttackOracleAges &oracle_age, Move last_move=Move::INVALID()) | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | [inline] |
| isWinningState(int node_limit, NumEffectState &state, const HashKey &key, const PathEncoding &path, Move &best_move, AttackOracleAges &oracle_age, Move last_move=Move::INVALID()) | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | |
| isWinningState(int node_limit, NumEffectState &state, const HashKey &key, const PathEncoding &path, Move &best_move, Move last_move=Move::INVALID()) | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | [inline] |
| isWinningStateByOracle(NumEffectState &state, const HashKey &key, const PathEncoding &path, Move &best_move, unsigned short &oracle_age, int node_limit=0) | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | [inline] |
| isWinningStateByOracleLastMove(NumEffectState &state, const HashKey &key, const PathEncoding &path, Move &best_move, Move last_move, unsigned short &oracle_age, int node_limit=0) | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | [inline] |
| isWinningStateByOracleLastMove(NumEffectState &state, const HashKey &key, const PathEncoding &path, Move &best_move, Move last_move, unsigned short &age) | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | [inline] |
| mainNodeCount() const | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | [inline] |
| prover_t typedef | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | |
| searcher(Player P) const | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | [inline] |
| setVerbose(bool verbose=true) | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | [inline] |
| table_t typedef | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | |
| totalNodeCount() const | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | [inline] |
| undoWriteRootHistory(const RepetitionCounter &counter, const MoveStack &moves, const SimpleState &state, Player attack) | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | |
| writeRootHistory(const RepetitionCounter &counter, const MoveStack &moves, const SimpleState &state, Player attack) | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | [inline] |
| ~DualCheckmateSearcher() | osl::checkmate::DualCheckmateSearcher< Table, HEstimator, CostEstimator > | [inline, virtual] |
