Multi-Cut αβ-Pruning in Game-Tree Search

@inproceedings{Bjrnsson1999MultiCutI,
  title={Multi-Cut αβ-Pruning in Game-Tree Search},
  author={Yngvi Bj{\"o}rnsson and Tony Marsland},
  year={1999}
}
The efficiency of the αβ-algorithm as a minimax search procedure can be attributed to its effective pruning at so-called cut-nodes; ideally only one move is examined there to establish the minimax value. This paper explores the benefits of investing additional search effort at cut-nodes by also expanding some of the remaining moves. Our results show a strong correlation between the number of promising move alternatives at cut-nodes and a new principal variation emerging. Furthermore, a new… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 15 references

and D

  • D. A. McAlleste
  • Yuret. Alpha-beta-conspiracy search,
  • 1993
1 Excerpt

Experiments with the Null Move, pages 65–89

  • D.G.Beal
  • Elsevier Science Publishers B.V.,
  • 1989
1 Excerpt

Similar Papers

Loading similar papers…