Live briefing
Everything about Best node search
Alpha-beta game tree search algorithm
Best node search (BNS), originally known as fuzzified game tree search, is a minimax search algorithm developed in 2011 that optimizes decision-making in game trees. BNS differentiates itself from traditional algorithms by identifying which moves (subtrees) are relatively better than others before calculating their exact minimax values, allowing for more efficient pruning of the search space. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Best node searchA 5-minute orientation
- Pick up a classic book: Computer networkingThe most-reprinted book on the subject
- Read the landmark paper: Best-First Tree Search with Probabilistic Node Ordering for MIMO Detection: Generalization and Performance-Complexity TradeoffCited 17 times
- Go sideways: Principal variation searchA closely related topic
- Go sideways: Alpha–beta pruningA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
📚 Books worth reading
Computer networkingJames F. Kurose, Keith W. Ross · 1900
Treaty Occupationay ToxicologySuelen Queiroz · 2010
Drupal 7 bibleRic Shreves · 2011
Data structures, algorithms, and applications in C++Sartaj Sahni · 1998
Coding the MatrixPhilip N. Klein · 2013
Data structures using C and C++Yedidyah Langsam · 2000
Data structures using Cand C[plus plus]Yedidyah Langsam · 1996
Data structures & other objects using C++M. Main · 2001
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Principal variation search Principal variation search (sometimes equated with the practically identical NegaScout) is a negamax algorithm that can be faster than alpha–beta pruning…
- Alpha–beta pruning Alpha–beta pruning is a tree search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree…
- Negamax Negamax search is a variant form of minimax search that relies on the zero-sum property of a two-player game. This algorithm relies on the fact that min(a…
- Expectiminimax The expectiminimax algorithm is a variation of the minimax algorithm, for use in artificial intelligence systems that play two-player zero-sum games, such…
- MTD(f) MTD(f) is an alpha-beta game tree search algorithm modified to use ‘zero-window’ initial search bounds, and memory (usually a transposition table) to reuse…
- SSS* SSS* is a search algorithm introduced by George Stockman in 1979. It conducts a state space search traversing a game tree in a best-first fashion similar…
- Minimax Minimax (sometimes Minmax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, combinatorial game theory, statistics…
- B* In computer science, B* (pronounced "B star") is a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal…