Tree-Searching and Tree-Pruning Techniques

  • John Birmingham
  • Peter Kent

Abstract

This paper first discusses the now standard tree searching techniques of mini-max and alpha-beta and the recent improvements to alpha-beta, in particular the killer heuristic. It then describes a new and very powerful technique that we have termed ‘razoring’. Unlike the alpha-beta technique, razoring cannot guarantee finding the optimum solution but it will, however, always find a good solution in a much shorter time. Typically a four-ply tree with a branching factor of 33 can be searched an order of magnitude faster than with alpha-beta. We also discuss ‘forward marginal pruning’ — a technique similar to razoring.

Keywords

Ation Function Node Count Game Tree Node Evaluation Bottom Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© David Levy 1988

Authors and Affiliations

  • John Birmingham
  • Peter Kent

There are no affiliations available

Personalised recommendations