{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:42:07Z","timestamp":1725896527828},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642344121"},{"type":"electronic","value":"9783642344138"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34413-8_16","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T05:58:57Z","timestamp":1349071137000},"page":"220-234","source":"Crossref","is-referenced-by-count":2,"title":["Upper Confidence Tree-Based Consistent Reactive Planning Application to MineSweeper"],"prefix":"10.1007","author":[{"given":"Mich\u00e8le","family":"Sebag","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Teytaud","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Audibert, J.-Y., Munos, R., Szepesvari, C.: Use of variance estimation in the multi-armed bandit problem. In: NIPS 2006 Workshop on On-line Trading of Exploration and Exploitation (2006)"},{"key":"16_CR2","first-page":"397","volume":"3","author":"P. Auer","year":"2003","unstructured":"Auer, P.: Using confidence bounds for exploitation-exploration trade-offs. The Journal of Machine Learning Research\u00a03, 397\u2013422 (2003)","journal-title":"The Journal of Machine Learning Research"},{"issue":"2\/3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Machine Learning\u00a047(2\/3), 235\u2013256 (2002)","journal-title":"Machine Learning"},{"key":"16_CR4","first-page":"23","volume":"17","author":"K. Becker","year":"2001","unstructured":"Becker, K.: Teaching with games: the minesweeper and asteroids experience. J. Comput. Small Coll.\u00a017, 23\u201333 (2001)","journal-title":"J. Comput. Small Coll."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/1113847.1113873","volume":"37","author":"M.M. Ben-Ari","year":"2005","unstructured":"Ben-Ari, M.M.: Minesweeper as an NP-complete problem. SIGCSE Bull.\u00a037, 39\u201340 (2005)","journal-title":"SIGCSE Bull."},{"key":"16_CR6","unstructured":"Bertsekas, D., Tsitsiklis, J.: Neuro-dynamic Programming. Athena Scientific (1996)"},{"key":"16_CR7","unstructured":"Castillo, L.P.: Learning minesweeper with multirelational learning. In: Proc. of the 18th Int. Joint Conf. on Artificial Intelligence, pp. 533\u2013538 (2003)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-642-25566-3_32","volume-title":"Learning and Intelligent Optimization","author":"A. Cou\u00ebtoux","year":"2011","unstructured":"Cou\u00ebtoux, A., Hoock, J.-B., Sokolovska, N., Teytaud, O., Bonnard, N.: Continuous Upper Confidence Trees. In: Coello, C.A.C. (ed.) LION 5. LNCS, vol.\u00a06683, pp. 433\u2013445. Springer, Heidelberg (2011)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Couetoux, A., Milone, M., Teytaud, O.: Consistent belief state estimation, with application to mines. In: Proc. of the TAAI 2011 Conference (2011)","DOI":"10.1109\/TAAI.2011.55"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Coulom, R.: Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. In: Ciancarini, P., van den Herik, H.J. (eds.) Proc. of the 5th Int. Conf. on Computers and Games, pp. 72\u201383 (2006)","DOI":"10.1007\/978-3-540-75538-8_7"},{"issue":"4","key":"16_CR11","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1088\/0031-9120\/45\/4\/008","volume":"45","author":"M. Gordon","year":"2010","unstructured":"Gordon, M., Gordon, G.: Quantum computer games: quantum Minesweeper. Physics Education\u00a045(4), 372 (2010)","journal-title":"Physics Education"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Hein, K.B., Weiss, R.: Minesweeper for sensor networks\u2013making event detection in sensor networks dependable. In: Proc. of the 2009 Int. Conf. on Computational Science and Engineering, CSE 2009, vol.\u00a001, pp. 388\u2013393. IEEE Computer Society (2009)","DOI":"10.1109\/CSE.2009.146"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF03025367","volume":"22","author":"R. Kaye","year":"2000","unstructured":"Kaye, R.: Minesweeper is NP-complete. Mathematical Intelligencer\u00a022, 9\u201315 (2000)","journal-title":"Mathematical Intelligencer"},{"key":"16_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L. Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit Based Monte-Carlo Planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol.\u00a04212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"16_CR15","unstructured":"Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press (1994)"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","volume":"6","author":"T. Lai","year":"1985","unstructured":"Lai, T., Robbins, H.: Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics\u00a06, 4\u201322 (1985)","journal-title":"Advances in Applied Mathematics"},{"key":"16_CR17","unstructured":"Lee, C.-S., Wang, M.-H., Chaslot, G., Hoock, J.-B., Rimmel, A., Teytaud, O., Tsai, S.-R., Hsu, S.-C., Hong, T.-P.: The Computational Intelligence of MoGo Revealed in Taiwan\u2019s Computer Go Tournaments. IEEE Transactions on Computational Intelligence and AI in Games (2009)"},{"key":"16_CR18","unstructured":"Nakov, P., Wei, Z.: Minesweeper, #minesweeper (2003)"},{"key":"16_CR19","unstructured":"Pedersen, K.: The complexity of Minesweeper and strategies for game playing. Project report, univ. Warwick (2004)"},{"key":"16_CR20","unstructured":"ROADEF-Challenge. A large-scale energy management problem with varied constraints (2010), \n                    \n                      http:\/\/challenge.roadef.org\/2010\/"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-04174-7_20","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"P. Rolet","year":"2009","unstructured":"Rolet, P., Sebag, M., Teytaud, O.: Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm. In: Buntine, W., Grobelnik, M., Mladeni\u0107, D., Shawe-Taylor, J. (eds.) ECML PKDD 2009, Part II. LNCS, vol.\u00a05782, pp. 302\u2013317. Springer, Heidelberg (2009)"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Rolet, P., Sebag, M., Teytaud, O.: Optimal robust expensive optimization is tractable. In: GECCO 2009, Montr\u00e9al Canada, 8 p. ACM Press (2009)","DOI":"10.1145\/1569901.1570255"},{"key":"16_CR23","unstructured":"Studholme, C.: Minesweeper as a constraint satisfaction problem. Unpublished project report (2000)"},{"key":"16_CR24","unstructured":"Sutton, R., Barto, A.G.: Reinforcement learning. MIT Press (1998)"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Teytaud, F., Teytaud, O.: On the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms. In: IEEE Conf. on Computational Intelligence and Games, Copenhagen, Denmark (2010)","DOI":"10.1109\/ITW.2010.5593334"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34413-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:14:13Z","timestamp":1558314853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34413-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642344121","9783642344138"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34413-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}