Multi-cut -pruning in game-tree search
From MaRDI portal
Publication:1589514
DOI10.1016/S0304-3975(00)00081-5zbMATH Open0954.68057MaRDI QIDQ1589514FDOQ1589514
Authors: T. A. Marsland, Yngvi Björnsson 
Publication date: 12 December 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- Multi-player alpha-beta pruning
- Probability-based game tree pruning
- Pruning playouts in Monte Carlo tree search for the game of Havannah
- On pruning search trees of impartial games
- Pruning algorithms for multi-model adversary search
- A general framework for minimax search in game trees
- Enhancements for multi-player Monte-Carlo tree search
Cites Work
Cited In (12)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An analysis of the full alpha-beta pruning algorithm
- Probability-based game tree pruning
- Multi-player alpha-beta pruning
- Two-agent IDA*
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extended Null-Move Reductions
- Temporal difference learning applied to game playing and the results of application to Shogi
- D* Extra Lite: a dynamic A* with search-tree cutting and frontier-gap repairing
This page was built for publication: Multi-cut \(\alpha \beta\)-pruning in game-tree search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589514)
