Wim Pijls, Arie de Bruin  Home/Search
Context Related
| cs.few.eur.nl/pub/doc...eurcs9606.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fermivista.math...p.cs.few.eur.nl (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, a theory of game tree algorithms is presented, entirely based upon the concept of solution tree. Two types of solution trees are distinguished: max and min solution trees respectively. We show that a game tree algorithm actually constructs a superposition of a max and a min solution tree. For algorithms searching a game tree, a cutoff criterion is suitable. A cut-off criterion in terms of solution trees will be formulated, which can be used to eliminate nodes from the search... (Update)
Cited by: More
Trends in Game Tree Search - de Bruin, Pijls (1996) (Correct)
Similar documents (at the sentence level):
63.9%: A Theory of Game Trees, Based on Solution Trees - Pijls, de Bruin, Plaat (1996) (Correct)
Active bibliography (related documents): More All
1.3: Solution Trees as a Basis for Game Tree Search - de Bruin, Pijls, Plaat (1994) (Correct)
0.9: A Minimax Algorithm Better than Alpha-Beta? No and Yes - Plaat, Schaeffer, Pijls, de .. (1995) (Correct)
0.9: Best-First Fixed-Depth Minimax Algorithms - Plaat, Schaeffer, Pijls, de Bruin (1996) (Correct)
Similar documents based on text: More All
0.2: Best-First Fixed-Depth Game-Tree Search in Practice - Plaat, Schaeffer, Pijls, de.. (1995) (Correct)
0.2: A New Paradigm for Minimax Search - Plaat, Schaeffer, Pijls, de Bruin (1994) (Correct)
0.2: From Game Trees to Game Graphs - Kars (1990) (Correct)
BibTeX entry: (Update)
Wim Pijls and Arie de Bruin, A theory of game trees based on solution trees, Tech.Rep. EUR-CS-96-xxx, Erasmus University Rotterdam, 1996. http://citeseer.ist.psu.edu/pijls96theory.html More
@misc{ pijls96theory,
author = "W. Pijls and A. de Bruin",
title = "A theory of game trees based on solution trees",
text = "Wim Pijls and Arie de Bruin, A theory of game trees based on solution trees,
Tech.Rep. EUR-CS-96-xxx, Erasmus University Rotterdam, 1996.",
year = "1996",
url = "citeseer.ist.psu.edu/pijls96theory.html" }
Citations (may not include all citations):686 a guide to the Theory of NP-Completeness (context) - Garey, Johnson et al. - 1979
650 An axiomatic basis for computer programming (context) - Hoare - 1969
266 Heuristics -- intelligent search strategies for computer pro.. (context) - Pearl - 1984
107 An analysis of alpha-beta pruning (context) - Knuth, Moore - 1975
45 A minimax algorithm better than alpha-beta (context) - Stockman - 1979
28 Searching for Solutions in Games and Artificial Intelligence (context) - Allis - 1994
26 Low Overhead Alternatives to SSS (context) - Marsland, Reineveld et al. - 1987
25 A comparison of minimax tree search algorithms (context) - Campbell, Marsland - 1983
24 A General Branch and Bound Formulation for Understanding and.. (context) - Kumar, Kanal - 1983
23 Parallel Branch and Bound Formulations for AND/OR Tree Searc.. (context) - Kumar, Kanal - 1984
20 A minimax algorithm better than alpha-beta (context) - Roizen, Pearl - 1983
16 Generalization of alpha-beta and SSS* search procedures (context) - Ibaraki - 1986
14 Solution Trees as a Basis for Game Tree Search - de Bruin, Pijls et al. - 1994
12 A faster alternative to SSS* with extension to variable memo.. (context) - Bhattacharya, Bagchi - 1993
11 Maarten van der Meulen (context) - Allis - 1994
11 Asymptotical properties of minimax trees and game searching .. (context) - Pearl - 1980
11 Searching informed game trees - Pijls, de Bruin - 1992
11 Parallel alpha-beta search on arachne (context) - Fishburn, Finkel - 1980
11 Best-first fixed depth game tree search in practice - Plaat, Schaeffer et al. - 1995
10 the branching factor of the alpha-beta pruning algorithm (context) - Baudet - 1978
10 Search Techniques (context) - Pearl, Karp - 1987
10 Time-efficient state space search - Reinefeld, Ridinger - 1994
7 International Symposium SIGAL (context) - Pijls, de Bruin et al. - 1990
6 Best-first minimax search: First results (context) - Korf - 1993
5 Artificial Intelligence in perspective (context) - Bobrow - 1993
5 ICCA Journal (context) - Weill, NegaC - 1992
5 A Minimax Algorithm Better than SSS (context) - Plaat, Schaeffer et al. - 1996
2 based on solution trees (context) - Pijls, de Bruin et al. - 1996
2 Advances in Computer Chess (context) - Pijls, de Bruin - 1997
2 An improvement of the Scout tree-search algorithm (context) - Reineveld - 1983
2 Search Algorithms for Minimax Game Trees (context) - Ibaraki - 1991
1 Theory and Practice of Informatics (context) - de Bruin, Pijls et al. - 1996
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.few.eur.nl.html): More
Towards a Proof of the Kahn Principle for Linear Dynamic.. - de Bruin, Nienhuys-Cheng (1994) (Correct)
Unifying LL and LR parsing - Pijls (1993) (Correct)
Constructing Refinement Operators by Decomposing.. - Nienhuys-Cheng.. (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC