Game tree algorithms and solution trees (Q1589517): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Wim Pijls / rank
 
Normal rank
Property / author
 
Property / author: Arie de Bruin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Artificial intelligence in perspective: a retrospective on fifty volumes of the Artificial Intelligence journal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in alpha-beta search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of alpha-beta and \(SSS^*\) search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of alpha-beta pruning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimax algorithm better than alpha-beta? Yes and no / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimax algorithm better than alpha-beta? / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(00)00082-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964867441 / rank
 
Normal rank

Latest revision as of 11:58, 30 July 2024

scientific article
Language Label Description Also known as
English
Game tree algorithms and solution trees
scientific article

    Statements

    Identifiers