ON FORWARD PRUNING IN GAME-TREE SEARCH

[1]  Graham Kendall,et al.  An evolutionary approach for the tuning of a chess evaluation function using population dynamics , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[2]  G. Pólya.  Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen , 1937 .

[3]  Wee Sun Lee,et al.  RankCut - A Domain Independent Forward Pruning Method for Games , 2006, AAAI.

[4]  Gerard Maurice Baudet,et al.  The design and analysis of algorithms for asynchronous multiprocessors. , 1978 .

[5]  Siang Yew Chong,et al.  Evolved neural networks learning Othello strategies , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[6]  Michael Buro.  Toward Opening Book Learning , 1999, J. Int. Comput. Games Assoc..

[7]  Monty Newborn,et al.  Kasparov versus Deep Blue , 1997, Springer New York.

[8]  Christian Donninger,et al.  Null Move and Deep Search , 1993, J. Int. Comput. Games Assoc..

[9]  Rémi Coulom,et al.  Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search , 2006, Computers and Games.

[10]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[11]  Bruce Abramson,et al.  Control strategies for two-player games , 1989, CSUR.

[12]  E. Berlekamp,et al.  Winning Ways for Your Mathematical Plays , 1983 .

[13]  Jonathan Schaeffer,et al.  Conspiracy Numbers , 1990, Artif. Intell..

[14]  David N. L. Levy,et al.  The Sex Algorithm in Computer Chess , 1989, J. Int. Comput. Games Assoc..

[15]  Michael Buro,et al.  ProbCut: An Effective Selective Extension of the α-β Algorithm , 1995, J. Int. Comput. Games Assoc..

[16]  Hans J. Berliner,et al.  Chess as problem solving: the development of a tactics analyzer. , 1975 .

[17]  Michael Buro,et al.  From Simple Features to Sophisticated Evaluation Functions , 1998, Computers and Games.

[18]  Akihiro Kishimoto,et al.  A General Solution to the Graph History Interaction Problem , 2004, AAAI.

[19]  T. A. Marsland,et al.  A Review of Game-Tree Pruning , 1986, J. Int. Comput. Games Assoc..

[20]  Terrence J. Sejnowski,et al.  Learning to evaluate Go positions via temporal difference methods , 2001 .

[21]  Fred Popowich,et al.  Parallel Game-Tree Search , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[22]  Jürg Nievergelt,et al.  Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power , 2000, SOFSEM.

[23]  H. Jaap van den Herik,et al.  The Advantage of the Initiative , 2000, Inf. Sci..

[24]  Monty Newborn,et al.  How Computers Play Chess , 1990, J. Int. Comput. Games Assoc..

[25]  Ernst A. Heinz,et al.  Scalable Search in Computer Chess , 2000, Computational Intelligence.

[26]  Jonathan Schaeffer,et al.  Asynchronous parallel game-tree search , 1998 .

[27]  Yngvi Björnsson,et al.  THE 13th WORLD COMPUTER-CHESS CHAMPIONSHIP , 2005 .

[28]  Ernst A. Heinz,et al.  New Self-Play Results in Computer Chess , 2000, Computers and Games.

[29]  H. Jaap van den Herik,et al.  Proof-Number Search , 1994, Artif. Intell..

[30]  Thomas Thomsen.  Lambda-Search in Game Trees - with Application to Go , 2000, Computers and Games.

[31]  Tony Marsland,et al.  Multi-cut alpha-beta-pruning in game-tree search , 2001, Theor. Comput. Sci..

[32]  Alexander Reinefeld,et al.  An Improvement to the Scout Tree Search Algorithm , 1983, J. Int. Comput. Games Assoc..

[33]  Peter Sanders,et al.  Parallel Game Tree Search on SIMD Machines , 1995, IRREGULAR.

[34]  Jonathan Schaeffer,et al.  A World Championship Caliber Checkers Program , 1992, Artif. Intell..

[35]  Richard K. Belew,et al.  New Methods for Competitive Coevolution , 1997, Evolutionary Computation.

[36]  Alex Lubberts and Risto Miikkulainen.  Co-Evolving a Go-Playing Neural network , 2001 .

[37]  Donald F. Beal,et al.  A Memory Efficient Retrograde Algorithm and Its Application to Chinese Chess Endgames , 2002 .

[38]  Murray Campbell,et al.  Singular Extensions: Adding Selectivity to Brute-Force Searching , 1990, Artif. Intell..

[39]  Jonathan Schaeffer,et al.  One jump ahead - challenging human supremacy in checkers , 1997, J. Int. Comput. Games Assoc..

[40]  David J. Slate,et al.  Chess 4.5-The Northwestern University chess program , 1988 .

[41]  Hermann Kaindl.  Scalable Search in Computer Chess – Algorithmic Enhancements and Experiments at High Search Depths: Ernst A. Heinz, Vieweg, 2000 , 2000 .

[42]  Donald E. Eastlake,et al.  The Greenblatt chess program , 1967, AFIPS '67 (Fall).

[43]  Ivan Bratko,et al.  Why Minimax Works: An Alternative Explanation , 2005, IJCAI.

[44]  Csaba Szepesvári,et al.  Bandit Based Monte-Carlo Planning , 2006, ECML.

[45]  Michael Buro,et al.  First Experimental Results of ProbCut Applied to Chess , 2003, ACG.

[46]  Risto Miikkulainen,et al.  Discovering Complex Othello Strategies Through Evolutionary Neural Networks , 1995 .

[47]  Jack van Rijswijck.  Are Bees Better than Fruitflies? , 2000, Canadian Conference on AI.

[48]  Michael Buro,et al.  The Othello Match of the Year: Takeshi Murakami vs. Logistello , 1997, J. Int. Comput. Games Assoc..

[49]  Olivier Teytaud,et al.  Modification of UCT with Patterns in Monte-Carlo Go , 2006 .

[50]  Hiroyuki Iida,et al.  Computer shogi , 2002, Artif. Intell..

[51]  M. M. Newborn,et al.  The Efficiency of the Alpha-Beta Search on Trees with Branch-Dependent Terminal Node Scores , 1977, Artif. Intell..

[52]  Ernst A. Heinz.  Darkthought Goes Deep , 1998, J. Int. Comput. Games Assoc..

[53]  Andrew Tridgell,et al.  KnightCap: A Chess Programm That Learns by Combining TD(lambda) with Game-Tree Search , 1998, ICML.

[54]  Thomas Robert Lincke,et al.  Exploring the computational limits of large exhaustive search problems , 2002 .

[55]  P. Kent,et al.  Tree-searching and tree-pruning techniques , 1988 .

[56]  Henri E. Bal,et al.  Solving awari with parallel retrograde analysis , 2003, Computer.

[57]  Jürg Nievergelt,et al.  Computing Tigers and Goats , 2004, J. Int. Comput. Games Assoc..

[58]  Dana S. Nau,et al.  Quality of decision versus depth of search on game trees , 1979 .

[59]  Dana S. Nau,et al.  An Investigation of the Causes of Pathology in Games , 1982, Artif. Intell..

[60]  Levente Kocsis.  Learning search decisions , 2003 .

[61]  H. Jaap van den Herik,et al.  Games solved: Now and in the future , 2002, Artif. Intell..

[62]  D. Knuth.  Estimating the efficiency of backtrack programs. , 1974 .

[63]  Jonathan Schaeffer,et al.  Experiments in Search and Knowledge , 1986, J. Int. Comput. Games Assoc..

[64]  David A. McAllester.  Conspiracy Numbers for Min-Max Search , 1988, Artif. Intell..

[65]  Risto Miikkulainen,et al.  Evolving Neural Networks to Focus Minimax Search , 1994, AAAI.

[66]  Ernst A. Heinz.  Adaptive Null-Move Pruning , 1999, J. Int. Comput. Games Assoc..

[67]  Tristan Cazenave,et al.  Abstract Proof Search , 2000, Computers and Games.

[68]  Bruno Bouzy,et al.  Monte-Carlo Go Developments , 2003, ACG.

[69]  Wee Sun Lee,et al.  Properties of Forward Pruning in Game-Tree Search , 2006, AAAI.

[70]  Ivan Bratko,et al.  Bias and pathology in minimax search , 2005, Theor. Comput. Sci..

[71]  Guy Haworth,et al.  Space-Efficient Indexing of Chess Endgame Tables , 2000, J. Int. Comput. Games Assoc..

[72]  Monty Newborn,et al.  Kasparov versus Deep Blue - computer chess comes of age , 1996 .

[73]  David B. Fogel,et al.  Blondie24: Playing at the Edge of AI , 2001 .

[74]  Jonathan Schaeffer,et al.  Solving Checkers , 2005, IJCAI.

[75]  Guy Haworth,et al.  Chess endgames: 6-man data and strategy , 2005, Theor. Comput. Sci..

[76]  Jonathan Schaeffer,et al.  Exploiting Graph Properties of Game Trees , 1996, AAAI/IAAI, Vol. 1.

[77]  Selim G. Akl,et al.  The principal continuation and the killer heuristic , 1977, ACM '77.

[78]  Jeff Rollason,et al.  SUPER-SOMA - Solving Tactical Exchanges in Shogi without Tree Searching , 2000, Computers and Games.

[79]  K. Thompson,et al.  COMPUTER CHESS STRENGTH , 1982 .

[80]  James R. Slagle,et al.  Experiments With Some Programs That Search Game Trees , 1969, JACM.

[81]  Alexander Reinefeld,et al.  A Quantitative Analysis of Minimal Window Search , 1987, IJCAI.

[82]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[83]  Dana S. Nau,et al.  An Analysis of Forward Pruning , 1994, AAAI.

[84]  David Silver,et al.  Combining online and offline knowledge in UCT , 2007, ICML '07.

[85]  Martin Müller,et al.  Computer Go , 2002, Artif. Intell..

[86]  Andreas Junghanns,et al.  Diminishing Returns for Additional Search in Chess , 2007 .

[87]  Ken Thompson,et al.  Retrograde Analysis of Certain Endgames , 1986, J. Int. Comput. Games Assoc..

[88]  Ernst A. Heinz.  Extended Futility Pruning , 1998, J. Int. Comput. Games Assoc..

[89]  David Fotland,et al.  Go Intellect wins 19x19 Go tournament , 2004 .

[90]  T. Anthony Marsland,et al.  Risk Management in Game-Tree Pruning , 2000, Inf. Sci..

[91]  David B. Fogel,et al.  Evolving an expert checkers playing program without using human expertise , 2001, IEEE Trans. Evol. Comput..

[92]  Jonathan Schaeffer,et al.  Checkers Is Solved , 2007, Science.

[93]  Jonathan Schaeffer,et al.  The History Heuristic and Alpha-Beta Search Enhancements in Practice , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[94]  Donald E. Knuth,et al.  The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.

[95]  Thomas S. Anantharaman,et al.  A Statistical Study of Selective Min-Max Search in Computer Chess , 1991, J. Int. Comput. Games Assoc..

[96]  Hiroyuki Iida,et al.  The PN*-search algorithm: Application to tsume-shogi , 2001, Artif. Intell..