![]() The search tree as subset of the search space is a directed graph of nodes, the alternating white and black to move chess positions - and edges connecting two nodes, representing the moves of either side. Today most programs are closer to Type A, but have some characteristics of a Type B as mentioned in selectivity. Type B was most popular until the 1970's, when Type A programs had enough processing power and more efficient brute force algorithms to become stronger. ![]() Type B searches use some type of static heuristics in order to only look at branches that look important - with some risk to oversee some serious tactics not covered by the plausible move selector. ![]() Inspired by the experiments of Adriaan de Groot, Shannon and early programmers favored Type B strategy. Type B - a selective search looking at "important" branches only.Type A - a brute-force search looking at every variation to a given depth.Claude Shannon categorized searches into two types :
0 Comments
Leave a Reply. |