A and B-strategy are terms from the computer chess and the programming of chess and Go-programs.

A-strategy designates a procedure, which calculates all possible combinations of courses and countermoves for the determination of the best course after Claude Shannon. The usual name for the A-strategy is today the Brute Force method.

Contrary to the A-strategy a chess program plays in accordance with the B-strategy, if it scans only plausible - and not all - Zugfolgen with the analysis of a position. The B-strategy is understood every now and then as attempt to copy the human thought process with the analysis about variants. The first attempt to write such a chess program was undertaken 1955 to 1958 by all Newell, Shaw and Herbert Simon. It failed practically, and one began to understand that the realization of such a program is far more difficult, than one had first assumed.

Modern chess programs use predominantly modified forms of the A-strategy (Brute Force method)

Differently than in computer chess Go step the Brute Force methods to their borders with the board play. Here a research is toward intelligent solutions (B-strategy) differently than still in chess in full course.

Articles in category "B-strategy"

We found here 4 articles.

Related Websites

We found here 3 related websites.

• Chapter IV B. Strategy
  B. Strategy. The Army 6.2 program identifies and focuses on selected technologies that will provide the maximum warfighting capability for every dollar ...


• The CEMS Faculty Portal - Increasing the Scholarly Power of CEMS
  (B) Strategy (0) · (B) Accounting and Control (0) · (B) Corporate Citizenship and Business Ethics (0) · (B) Finance and Investment (0) ...


• VI.B. STRATEGY
  B. STRATEGY. The Army will continue a multi-faceted approach to support and maintain its infrastructure. Appropriated funds will be used to construct, ...