Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Asymptotic Properties of Minimax Trees and Game-Searching Procedures

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

DOI10.1145/3501714.3501723OpenAlexW4221129659MaRDI QIDQ5885609FDOQ5885609


Authors: Judea Pearl Edit this on Wikidata


Publication date: 4 April 2023

Published in: Probabilistic and Causal Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3501714.3501723





Mathematics Subject Classification ID

Artificial intelligence (68Txx)



Cited In (3)

  • Game tree searching by min/max approximation
  • Searching minimax game trees under memory space constraint
  • The Variance of Two Game Tree Algorithms





This page was built for publication: Asymptotic Properties of Minimax Trees and Game-Searching Procedures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5885609)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5885609&oldid=30750905"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 March 2024, at 05:59. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki