Learning time allocation using neural networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2063, Issue , 2001, Pages 170-185

  Kocsis, Levente ^a   Uiterwijk, Jos ^a   Van Den Herik, Jaap ^a  

^a MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

Genetic algorithms; Lines of action; Search decisions; Temporal difference learning; Time allocation

Indexed keywords

ALGORITHMS; COMPLEX NETWORKS; COMPUTER GAMES; FUNCTION EVALUATION; GENETIC ALGORITHMS; TREES (MATHEMATICS);

EVALUATION FUNCTION; GAME TREE SEARCH; GAME-PLAYING PROGRAMS; LINES OF ACTION; SEARCH ALGORITHMS; SEARCH DECISIONS; TEMPORAL DIFFERENCE LEARNING; TIME ALLOCATION;

LEARNING ALGORITHMS;

EID: 84958777158     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45579-5_11     Document Type: Conference Paper

References (35)

1. T.S. Anantharaman. Evaluation tuning for computer chess: Linear discriminant methods. ICCA Journal, 20(4): 224-242, 1997.
2. E.B. Baum and W.D. Smith. A bayesian approach to relevance in game playing. Artificial Intelligence, 97(1-2): 195-242, 1997.
3. J. Baxter, A. Tridgell, and L. Weaver. Experiments in parameter learning using temporal differences. ICCA Journal, 21(2): 84-99, 1998.
4. D.F. Beal and M.C. Smith. Learning piece values using temporal difference learning. ICCA Journal, 20(3): 147-151, 1997.
5. D.F. Beal and M.C. Smith. Temporal difference learning for heuristic search and game playing. Information Sciences, 122(1): 3-21, 2000.
6. Y. Björnsson and T. Marsland. Learning search control in adversary games. In H.J. van den Herik and B. Monien, editors. Proceedings of the Advances in Computer Games 9 Conference, 2000.
7. M. Buro. Experiments with Multi-ProbCut and a new high-quality evaluation function for Othello. In H. J. van den Herik and H. Iida, editors. Games in AI Research. 1999.
8. D. Carmel and S. Markovitch. Incorporating opponent models into adversary search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), pages 120-125, 1996.
9. K. Chellapilla and D.B. Fogel. Co-evolving checkers playing programs using only win, lose, or draw. In Proceedings of SPIE’s AeroSense’99: Applications and Science of Computational Intelligence II, 1999.
10. D.E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989.
11. D. Harada and S. Russell. Extended abstract: Learning search strategies. In AAAI Spring Symposium on Search Techniques for Problem Solving under Uncertainty and Incomplete Information, 1999.
12. E.A. Heinz. Adaptive null-move pruning. ICCA Journal, 22(3): 123-132, 1999.
13. R.M. Hyatt. Using time wisely. ICCA Journal, 7(1): 4-9, 1984.
14. H. Iida, J.W.H.M. Uiterwijk, H.J. van den Herik, and I.S. Herschberg. Potential applications of opponent-model search. Part 1: The domain of applicability. ICCA Journal, 16(4): 201-208, 1993.
15. T. Jaakkola, S. Singh, and M. Jordan. Reinforcement learning algorithm for partially observable markov problems. In Advances in Neural Information Processing Systems 7, pages 345-352, 1994.
16. L.P. Kaelbling, M.L. Littman, and A.R. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101(1-2): 99-134, 1998.
17. H. Kimura and S. Kobayashi. An analysis of actor/critic algorithms using eligibility traces: Reinforcement learning with imperfect value function. In Proceedings of the 15th International Conference on Machine Learning, pages 278-286, 1998.
18. V.R. Konda and V.S. Borkar. Actor-critic type learning algorithms for markov decision processes. SIAM Journal of Control and Optimisation, 38(1): 94-133, 1999.
19. V.R. Konda and J.N. Tsitsiklis. Actor-critic algorithms. In Advances in Neural Information Processing Systems 12, 2000.
20. B.C. Kuszmaul. The StarTech massively parallel chess program. ICCA Journal, 18(1): 3-19, 1995.
21. C. Leiserson. Using the Cilk multithreaded programming language to implement a multiprocessor chess program. In H.J. van den Herik and B. Monien, editors. Proceedings of the Advances in Computer Games 9 Conference, 2000.
22. S. Markovitch and Y. Sella. Learning of resource allocation strategies for game playing. Computational Intelligence, 12(1): 88-105, 1996.
23. T.M. Mitchell, R.M. Keller, and S. Kedar-Cabelli. Explanation-based generalization: A unifying view. Machine Learning, 1(1): 47-80, 1986.
24. D.E. Moriarty and R. Miikkulainen. Hierarchical evolution of neural networks. In Proceedings of the 1998 IEEE Conference on Evolutionary Computation, pages 428-433, 1998.
25. D.E. Moriarty, A.C. Schultz, and J.J. Grefenstette. Evolutionary algorithms for reinforcement learning. Journal of Artificial Intelligence Research, 11: 241-276, 1999.
26. N. Richards, D. Moriarty, and R. Miikkulainen. Evolving neural networks to play Go. Applied Intelligence, 8: 85-96, 1998.
27. S. Russell and E.H. Wefald. Do the Right Thing: Studies in Limited Rationality. MIT Press, 1991.
28. A.L. Samuel. Some studies in machine learning using the game of checkers. IBM Journal of Research and Development, 3(3): 211-229, 1959.
29. J. Schaeffer and A. Plaat. Kasparov versus DEEP BLUE: The rematch. ICCA Journal, 20(2): 95-101, 1997.
30. Y. Seirawan. The Kasparov - DEEP BLUE games. ICCA Journal, 20(2): 102-125, 1997.
31. R.S. Sutton and A.G. Barto. Reinforcement Learning: An Introduction. MIT Press, 1998.
32. R.S. Sutton, D. McAllester, S. Singh, and Y. Mansour. Policy gradient methods for reinforcement learning with function approximation. In Advances in Neural Information Processing Systems 12, pages 1057-1063, 2000.
33. G.J. Tesauro. Practical issues in temporal difference learning. Machine Learning, 8: 257-277, 1992.
34. S. Thrun. Learning to play the game of chess. In Advances in Neural Information Processing Systems 7, pages 1069-1076, 1995.
35. M.H.M. Winands. Analysis and implementation of Lines of Action. Master’s thesis, Department of Computer Science, Universiteit Maastricht, 2000.