{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T14:10:18Z","timestamp":1737555018644,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430803"},{"type":"electronic","value":"9783540455790"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45579-5_11","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T17:52:18Z","timestamp":1195235538000},"page":"170-185","source":"Crossref","is-referenced-by-count":4,"title":["Learning Time Allocation Using Neural Networks"],"prefix":"10.1007","author":[{"given":"Levente","family":"Kocsis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos","family":"Uiterwijk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaap","family":"van den Herik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,20]]},"reference":[{"issue":"4","key":"11_CR1","first-page":"224","volume":"20","author":"T.S. Anantharaman","year":"1997","unstructured":"T.S. Anantharaman. Evaluation tuning for computer chess: Linear discriminant methods. ICCA Journal, 20(4):224\u2013242, 1997.","journal-title":"ICCA Journal"},{"issue":"1-2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0004-3702(97)00059-3","volume":"97","author":"E.B. Baum","year":"1997","unstructured":"E.B. Baum and W.D. Smith. A bayesian approach to relevance in game playing. Artificial Intelligence, 97(1-2):195\u2013242, 1997.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"11_CR3","first-page":"84","volume":"21","author":"J. Baxter","year":"1998","unstructured":"J. Baxter, A. Tridgell, and L. Weaver. Experiments in parameter learning using temporal differences. ICCA Journal, 21(2):84\u201399, 1998.","journal-title":"ICCA Journal"},{"issue":"3","key":"11_CR4","first-page":"147","volume":"20","author":"D.F. Beal","year":"1997","unstructured":"D.F. Beal and M.C. Smith. Learning piece values using temporal difference learning. ICCA Journal, 20(3):147\u2013151, 1997.","journal-title":"ICCA Journal"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0020-0255(99)00093-6","volume":"122","author":"D.F. Beal","year":"2000","unstructured":"D.F. Beal and M.C. Smith. Temporal difference learning for heuristic search and game playing. Information Sciences, 122(1):3\u201321, 2000.","journal-title":"Information Sciences"},{"key":"11_CR6","unstructured":"Y. Bj\u00f6rnsson 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."},{"key":"11_CR7","unstructured":"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."},{"key":"11_CR8","unstructured":"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\u2013125, 1996."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"K. Chellapilla and D.B. Fogel. Co-evolving checkers playing programs using only win, lose, or draw. In Proceedings of SPIE\u2019s AeroSense\u201999: Applications and Science of Computational Intelligence II, 1999.","DOI":"10.1117\/12.342912"},{"key":"11_CR10","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"D.E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989."},{"key":"11_CR11","unstructured":"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."},{"issue":"3","key":"11_CR12","first-page":"123","volume":"22","author":"E.A. Heinz","year":"1999","unstructured":"E.A. Heinz. Adaptive null-move pruning. ICCA Journal, 22(3):123\u2013132, 1999.","journal-title":"ICCA Journal"},{"issue":"1","key":"11_CR13","first-page":"4","volume":"7","author":"R.M. Hyatt","year":"1984","unstructured":"R.M. Hyatt. Using time wisely. ICCA Journal, 7(1):4\u20139, 1984.","journal-title":"ICCA Journal"},{"issue":"4","key":"11_CR14","first-page":"201","volume":"16","author":"H. Iida","year":"1993","unstructured":"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\u2013208, 1993.","journal-title":"ICCA Journal"},{"key":"11_CR15","first-page":"345","volume":"7","author":"T. Jaakkola","year":"1994","unstructured":"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\u2013352, 1994.","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"1-2","key":"11_CR16","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0004-3702(98)00023-X","volume":"101","author":"L.P. Kaelbling","year":"1998","unstructured":"L.P. Kaelbling, M.L. Littman, and A.R. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101(1-2):99\u2013134, 1998.","journal-title":"Artificial Intelligence"},{"key":"11_CR17","unstructured":"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\u2013286, 1998."},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1137\/S036301299731669X","volume":"38","author":"V.R. Konda","year":"1999","unstructured":"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\u2013133, 1999.","journal-title":"SIAM Journal of Control and Optimisation"},{"key":"11_CR19","unstructured":"V.R. Konda and J.N. Tsitsiklis. Actor-critic algorithms. In Advances in Neural Information Processing Systems 12, 2000."},{"issue":"1","key":"11_CR20","first-page":"3","volume":"18","author":"B.C. Kuszmaul","year":"1995","unstructured":"B.C. Kuszmaul. The StarTech massively parallel chess program. ICCA Journal, 18(1):3\u201319, 1995.","journal-title":"ICCA Journal"},{"key":"11_CR21","unstructured":"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."},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1111\/j.1467-8640.1996.tb00254.x","volume":"12","author":"S. Markovitch","year":"1996","unstructured":"S. Markovitch and Y. Sella. Learning of resource allocation strategies for game playing. Computational Intelligence, 12(1):88\u2013105, 1996.","journal-title":"Computational Intelligence"},{"issue":"1","key":"11_CR23","first-page":"47","volume":"1","author":"T.M. Mitchell","year":"1986","unstructured":"T.M. Mitchell, R.M. Keller, and S. Kedar-Cabelli. Explanation-based generalization: A unifying view. Machine Learning, 1(1):47\u201380, 1986.","journal-title":"Machine Learning"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"D.E. Moriarty and R. Miikkulainen. Hierarchical evolution of neural networks. In Proceedings of the 1998 IEEE Conference on Evolutionary Computation, pages 428\u2013433, 1998.","DOI":"10.1109\/ICEC.1998.699793"},{"key":"11_CR25","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1613\/jair.613","volume":"11","author":"D.E. Moriarty","year":"1999","unstructured":"D.E. Moriarty, A.C. Schultz, and J.J. Grefenstette. Evolutionary algorithms for reinforcement learning. Journal of Artificial Intelligence Research, 11:241\u2013276, 1999.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1023\/A:1008224732364","volume":"8","author":"N. Richards","year":"1998","unstructured":"N. Richards, D. Moriarty, and R. Miikkulainen. Evolving neural networks to play Go. Applied Intelligence, 8:85\u201396, 1998.","journal-title":"Applied Intelligence"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"S. Russell and E.H. Wefald. Do the Right Thing: Studies in Limited Rationality. MIT Press, 1991.","DOI":"10.7551\/mitpress\/2474.001.0001"},{"issue":"3","key":"11_CR28","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1147\/rd.33.0210","volume":"3","author":"A.L. Samuel","year":"1959","unstructured":"A.L. Samuel. Some studies in machine learning using the game of checkers. IBM Journal of Research and Development, 3(3):211\u2013229, 1959.","journal-title":"IBM Journal of Research and Development"},{"issue":"2","key":"11_CR29","first-page":"95","volume":"20","author":"J. Schaeffer","year":"1997","unstructured":"J. Schaeffer and A. Plaat. Kasparov versusDEEPBLUE: The rematch. ICCA Journal, 20(2):95\u2013101, 1997.","journal-title":"ICCA Journal"},{"issue":"2","key":"11_CR30","first-page":"102","volume":"20","author":"Y. Seirawan","year":"1997","unstructured":"Y. Seirawan. The Kasparov-DEEP BLUE games. ICCA Journal, 20(2):102\u2013125, 1997.","journal-title":"ICCA Journal"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"R.S. Sutton and A.G. Barto. Reinforcement Learning: An Introduction. MIT Press, 1998.","DOI":"10.1109\/TNN.1998.712192"},{"key":"11_CR32","first-page":"1057","volume":"12","author":"R.S. Sutton","year":"2000","unstructured":"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\u20131063, 2000.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"11_CR33","first-page":"257","volume":"8","author":"G.J. Tesauro","year":"1992","unstructured":"G.J. Tesauro. Practical issues in temporal difference learning. Machine Learning, 8:257\u2013277, 1992.","journal-title":"Machine Learning"},{"key":"11_CR34","first-page":"1069","volume":"7","author":"S. Thrun","year":"1995","unstructured":"S. Thrun. Learning to play the game of chess. In Advances in Neural Information Processing Systems 7, pages 1069\u20131076, 1995.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"11_CR35","unstructured":"M.H.M. Winands. Analysis and implementation of Lines of Action. Master\u2019s thesis, Department of Computer Science, Universiteit Maastricht, 2000."}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45579-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T13:40:24Z","timestamp":1737553224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45579-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430803","9783540455790"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-45579-5_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}