Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Multi-cut \(\alpha \beta\)-pruning in game-tree search

From MaRDI portal
Publication:1589514
Jump to:navigation, search

DOI10.1016/S0304-3975(00)00081-5zbMath0954.68057MaRDI QIDQ1589514

T. A. Marsland, Yngvi Björnsson

Publication date: 12 December 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)


zbMATH Keywords

forward-pruning methodminimax search procedure


Mathematics Subject Classification ID

Searching and sorting (68P10)


Related Items (2)

Extended Null-Move Reductions ⋮ Temporal difference learning applied to game playing and the results of application to Shogi




Cites Work

  • An analysis of alpha-beta pruning




This page was built for publication: Multi-cut \(\alpha \beta\)-pruning in game-tree search

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1589514&oldid=13882042"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 02:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki