Type+A+Strategy

toc
 * Home * Search * Type A Strategy**

The **Type A Strategy** was coined in 1949 by Claude Shannon in his groundbreaking publication //Programming a Computer for Playing Chess// as a brute-force strategy, which Shannon concluded would be both slow and a weak player, due to the average branching factor and the huge exponential explosion. He therefor favored to search only a small subset of plausible moves within a Type B strategy. However, with the advent of alpha-beta and all its enhancement, brute-force got very successful from the 70s until present, since the task of classifying and excluding "not plausible" moves, turned out to be quite difficult and error-prone.

=Quotes= from Shannon's //Programming a Computer for Playing Chess//:

code Max Min   Max    Min    f(M_ijkl M_ijk M_ij M_i P)      M_i  M_ij  M_ijk  M_ijkl. . . . (1) code

=See also=
 * Alpha-Beta
 * Brute-Force
 * Minimax
 * Shannon's Type B Strategy

=External Links=
 * [|Subject: brute-force vs. intuition in math & chess] by [|Bill Dubuque], August 1996
 * [|Brute-force search from Wikipedia]

=References= =What links here?= include page="Type A Strategy" component="backlinks" limit="40"
 * Up one Level**