Learning search decisions
暂无分享,去创建一个
[1] A. Bernstein,et al. A chess playing program for the IBM 704 , 1899, IRE-ACM-AIEE '58 (Western).
[2] Selim G. Akl,et al. The principal continuation and the killer heuristic , 1977, ACM '77.
[3] David E. Wilkins,et al. Using Knowledge to Control Tree Searching , 1982, Artif. Intell..
[4] Jonathan Schaeffer. The History Heuristic , 1983, J. Int. Comput. Games Assoc..
[5] Robert M. Hyatt,et al. Using Time Wisely , 1984, J. Int. Comput. Games Assoc..
[6] T. A. Marsland,et al. A Review of Game-Tree Pruning , 1986, J. Int. Comput. Games Assoc..
[7] P W Frey,et al. Algorithmic strategies for improving the performance of game-playing programs , 1986 .
[8] S. Martello,et al. Algorithms for Knapsack Problems , 1987 .
[9] Gerald Tesauro,et al. Connectionist Learning of Expert Preferences by Comparison Training , 1988, NIPS.
[10] Steven Minton,et al. Learning search control knowledge , 1988 .
[11] David A. McAllester. Conspiracy Numbers for Min-Max Search , 1988, Artif. Intell..
[12] Sanjoy Mahajan,et al. A Pattern Classification Approach to Evaluation Function Learning , 1988, Artif. Intell..
[13] Robert Levinson,et al. A Self-Learning, Pattern-Oriented Chess Program , 1989, J. Int. Comput. Games Assoc..
[14] Jonathan Schaeffer,et al. The History Heuristic and Alpha-Beta Search Enhancements in Practice , 1989, IEEE Trans. Pattern Anal. Mach. Intell..
[15] David N. L. Levy,et al. The Sex Algorithm in Computer Chess , 1989, J. Int. Comput. Games Assoc..
[16] T. Scherzer,et al. Learning in Bebe , 1990 .
[17] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[18] Herbert D. Enderton. The Golem Go Program , 1991 .
[19] Stuart J. Russell,et al. Do the right thing - studies in limited rationality , 1991 .
[20] Paul E. Utgoff,et al. Automatic Feature Generation for Problem Solving Systems , 1992, ML.
[21] Jos W. H. M. Uiterwijk. The Countermove Heuristic , 1992, J. Int. Comput. Games Assoc..
[22] Shaul Markovitch,et al. LEARNING OF RESOURCE ALLOCATION STRATEGIES FOR GAME PLAYING , 1993, IJCAI.
[23] Christian Donninger,et al. Null Move and Deep Search , 1993, J. Int. Comput. Games Assoc..
[24] Tai-Ming Parng,et al. The Guard Heuristic: Legal Move Ordering with Forward Game-Tree Pruning , 1993, J. Int. Comput. Games Assoc..
[25] Eduardo Morales,et al. Learning Patterns for Playing Strategies , 1994, J. Int. Comput. Games Assoc..
[26] Risto Miikkulainen,et al. Evolving Neural Networks to Focus Minimax Search , 1994, AAAI.
[27] Dana S. Nau,et al. An Analysis of Forward Pruning , 1994, AAAI.
[28] Risto Miikkulainen,et al. Learning Sequential Decision Tasks , 1995 .
[29] Yasser Seirawan. The Kasparov - Deep Blue Games , 1996, J. Int. Comput. Games Assoc..
[30] Shirish Chinchalkar,et al. An Upper Bound for the Number of Reachable Positions , 1996, J. Int. Comput. Games Assoc..
[31] M. Alicia Pérez. Representing and Learning Quality-Improving Search Control Knowledge , 1996, ICML.
[32] H. Jaap van den Herik,et al. Replacement Schemes and Two-Level Tables , 1996, J. Int. Comput. Games Assoc..
[33] Monty Newborn,et al. Crafty Goes Deep , 1997, J. Int. Comput. Games Assoc..
[34] Eric B. Baum,et al. A Bayesian Approach to Relevance in Game Playing , 1997, Artif. Intell..
[35] Jonathan Schaeffer,et al. Kasparov versus Deep Blue: The Rematch , 1997, J. Int. Comput. Games Assoc..
[36] Guy Haworth,et al. Chess Endgames and Neural Networks , 1998, J. Int. Comput. Games Assoc..
[37] Saïd Hanafi,et al. An efficient tabu search approach for the 0-1 multidimensional knapsack problem , 1998, Eur. J. Oper. Res..
[38] Shigenobu Kobayashi,et al. An Analysis of Actor/Critic Algorithms Using Eligibility Traces: Reinforcement Learning with Imperfect Value Function , 1998, ICML.
[39] Andrew Tridgell,et al. Experiments in Parameter Learning Using Temporal Differences , 1998, J. Int. Comput. Games Assoc..
[40] T. Anthony Marsland,et al. Multi-cut Pruning in Alpha-Beta Search , 1998, Computers and Games.
[41] Doina Precup,et al. Constructive Function Approximation , 1998 .
[42] Ernst A. Heinz. Extended Futility Pruning , 1998, J. Int. Comput. Games Assoc..
[43] Robert M. Hyatt,et al. Rotated Bitmaps, a New Twist on an Old Idea , 1999, J. Int. Comput. Games Assoc..
[44] David A. Bell,et al. A Pattern-Oriented Approach to Move Ordering: The Chessmaps Heuristic , 1999, J. Int. Comput. Games Assoc..
[45] Daishi Harada,et al. Extended abstract: Learning search strategies , 1999 .
[46] John N. Tsitsiklis,et al. Actor-Critic Algorithms , 1999, NIPS.
[47] Ernst A. Heinz. Adaptive Null-Move Pruning , 1999, J. Int. Comput. Games Assoc..
[48] Robert M. Hyatt,et al. Book Learning - a Methodology to Tune an Opening Book Automatically , 1999, J. Int. Comput. Games Assoc..
[49] Michael Buro. Toward Opening Book Learning , 1999, J. Int. Comput. Games Assoc..
[50] Yishay Mansour,et al. Policy Gradient Methods for Reinforcement Learning with Function Approximation , 1999, NIPS.
[51] Murray Campbell,et al. Knowledge discovery in deep blue , 1999, Commun. ACM.
[52] David B. Fogel,et al. Co-evolving checkers-playing programs using only win, lose, or draw , 1999, Defense, Security, and Sensing.
[53] Jack van Rijswijck,et al. Learning from Perfection. A Data Mining Approach to Evaluation Function Learning in Awari , 2000, Computers and Games.
[54] H. Jaap van den Herik,et al. Learning Time Allocation Using Neural Networks , 2000, Computers and Games.
[55] Jonathan Schaeffer,et al. The games computers (and people) play , 2000, Adv. Comput..
[56] Thomas R. Lincke,et al. Strategies for the Automatic Construction of Opening Books , 2000, Computers and Games.
[57] H. Jaap van den Herik,et al. Move Ordering Using Neural Networks , 2001, IEA/AIE.
[58] Jonathan Schaeffer,et al. A Gamut of Games , 2001, AI Mag..
[59] Levente Kocsis,et al. Search-independent forward pruning , 2001 .
[60] Johannes Fürnkranz,et al. Machine learning in games: a survey , 2001 .
[61] H. Jaap van den Herik,et al. The Quad Heuristic in Lines of Action , 2001, J. Int. Comput. Games Assoc..
[62] Susan L. Epstein. Learning to play expertly: a tutorial on Hoyle , 2001 .
[63] H. Jaap van den Herik,et al. Learning in Lines of Action , 2002, GAME-ON.
[64] T. Anthony Marsland,et al. Learning Control of Search Extensions , 2002, JCIS.
[65] Brian Sheppard,et al. World-championship-caliber Scrabble , 2002, Artif. Intell..
[66] Eric O. Postma,et al. Local Move Prediction in Go , 2002, Computers and Games.
[67] Tony Marsland,et al. Selective depth-first game-tree search , 2002 .
[68] Eric O. Postma,et al. The Neural MoveMap Heuristic in Chess , 2002, Computers and Games.
[69] Takashi Chikayama,et al. Game-tree Search Algorithm based on Realization Probability , 2002, J. Int. Comput. Games Assoc..
[70] H. Jaap van den Herik,et al. Games solved: Now and in the future , 2002, Artif. Intell..
[71] Pedro Isasi Viñuela,et al. Using genetic programming to learn and improve control knowledge , 2002, Artif. Intell..
[72] H. Jaap van den Herik,et al. Two Learning Algorithms for Forward Pruning , 2003, J. Int. Comput. Games Assoc..
[73] Tom M. Mitchell,et al. Explanation-Based Generalization: A Unifying View , 1986, Machine Learning.
[74] Richard S. Sutton,et al. Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.