Corpus ID: 60418986

RESEARCH RE: SEARCH & RE-SEARCH

@inproceedings{Plaat1996RESEARCHRS,
  title={RESEARCH RE: SEARCH & RE-SEARCH},
  author={A. Plaat},
  year={1996}
}
  • A. Plaat
  • Published 1996
  • Computer Science
  • Search algorithms are often categorized by their node expansion strategy. One option is the depth-first strategy, a simple backtracking strategy that traverses the search space in the order in which successor nodes are generated. An alternative is the best-first strategy, which was designed to make it possible to use domain-specific heuristic information. By exploring promising parts of the search space first, best-first algorithms are usually more efficient than depth-first algorithms. In… CONTINUE READING
    Best-First Fixed-Depth Minimax Algorithms
    • 82
    • Open Access
    The PN*-search algorithm: Application to tsume-shogi
    • 43
    • Open Access
    RankCut - A Domain Independent Forward Pruning Method for Games
    • 6
    • Open Access
    Automatic Generation of Search Engines
    • 7
    • Open Access
    Asynchronous parallel game-tree search
    • 36
    • Highly Influenced
    • Open Access
    Theory and practical strategies for e cient alpha-beta-searches in computer chess
    Classical Checkers
    A Refinement-Based Heuristic Method for Decision Making in the Context of Ayo Game
    • 3
    • Highly Influenced
    • Open Access

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 135 REFERENCES
    Best-First Fixed-Depth Game-Tree Search in Practice
    • 34
    • Open Access
    Best-First Minimax Search: First Results
    • 14
    • Open Access
    A Review of Game-Tree Pruning
    • 108
    • Open Access
    BS*: An Admissible Bidirectional Staged Heuristic Search Algorithm
    • 84
    The *-Minimax Search Procedure for Trees Containing Chance Nodes
    • 112
    • Open Access
    How to Use Limited Memory in Heuristic Search
    • 34
    • Open Access
    The B* Tree Search Algorithm: A Best-First Proof Procedure
    • 222
    • Highly Influential
    • Open Access
    A New Paradigm for Minimax Search
    • 37
    • Open Access
    Best-First Minimax Search: Othello Results
    • 18
    • Open Access
    Enhanced Iterative-Deepening Search
    • 152
    • Open Access