Multi-cut \(\alpha \beta\)-pruning in game-tree search
type: Item
instance of: scholarly article
title: Multi-cut \(\alpha \beta\)-pruning in game-tree search
zbMATH Open document ID: 0954.68057
DOI: 10.1016/S0304-3975(00)00081-5
author: T. A. Marsland
author: Yngvi Björnsson
published in: Theoretical Computer Science
publication date: 2000-12-12T00:00:00Z
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 1542314
zbMATH Keywords: minimax search procedure
zbMATH Keywords: forward-pruning method
MaRDI profile type: Publication
cites work: An analysis of alpha-beta pruning
Recommended article: Multi-player alpha-beta pruning
Recommended article: Probability-based game tree pruning
Recommended article: Pruning playouts in Monte Carlo tree search for the game of Havannah
Recommended article: On pruning search trees of impartial games
Recommended article: Pruning algorithms for multi-model adversary search
Recommended article: A general framework for minimax search in game trees
Recommended article: Enhancements for Multi-Player Monte-Carlo Tree Search
description: scientific article; zbMATH DE number 1542314