A comparison of minimax tree search algorithms (Q1838331): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0004-3702(83)90001-2
+Normal rank
@@ Property / OpenAlex ID @@
+W1974281669
@@ Property / OpenAlex ID: W1974281669 / rank @@
+Normal rank
@@ Property / cites work @@
+On the branching factor of the alpha-beta pruning algorithm
+Normal rank
@@ Property / cites work @@
+An analysis of alpha-beta pruning
@@ Property / cites work: An analysis of alpha-beta pruning / rank @@
+Normal rank
@@ Property / cites work @@
+The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
+Normal rank
@@ Property / cites work @@
+Asymptotic properties of minimax trees and game-searching procedures
+Normal rank
@@ Property / cites work @@
+Q3912009
@@ Property / cites work: Q3912009 / rank @@
+Normal rank
@@ Property / cites work @@
+Experiments With Some Programs That Search Game Trees
+Normal rank
@@ Property / cites work @@
+A minimax algorithm better than alpha-beta?
@@ Property / cites work: A minimax algorithm better than alpha-beta? / rank @@
+Normal rank