{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T15:10:01Z","timestamp":1748790601997,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662496183"},{"type":"electronic","value":"9783662496190"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49619-0_2","type":"book-chapter","created":{"date-parts":[[2016,2,26]],"date-time":"2016-02-26T08:58:59Z","timestamp":1456477139000},"page":"10-44","source":"Crossref","is-referenced-by-count":1,"title":["On Achieving History-Based Move Ordering in Adversarial Board Games Using Adaptive Data Structures"],"prefix":"10.1007","author":[{"given":"Spencer","family":"Polk","sequence":"first","affiliation":[]},{"given":"B. John","family":"Oommen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0029563","volume-title":"Online Algorithms","author":"S Albers","year":"1998","unstructured":"Albers, S., Westbrook, J.: Self-organizing data structures. In: Fiat, A. (ed.) Online Algorithms 1996. LNCS, vol. 1442, pp. 13\u201351. Springer, Heidelberg (1998)"},{"key":"2_CR2","unstructured":"Coe, R.: It\u2019s the effect size, stupid: what effect size is and why it is important. In: Annual Conference of the British Educational Research Association, University of Exeter, Exeter, Devon (2002)"},{"key":"2_CR3","first-page":"302","volume-title":"Introduction to Algorithms","author":"TH Corman","year":"2009","unstructured":"Corman, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn, pp. 302\u2013320. MIT Press, Upper Saddle River (2009)","edition":"3"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Estivill-Castro, V.: Move-to-end is best for double-linked lists. In: Proceedings of the Fourth International Conference on Computing and Information, pp. 84\u201387 (1992)","DOI":"10.1109\/ICCI.1992.227699"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Gonnet, G.H., Munro, J.I., Suwanda, H.: Towards self-organizing linear search. In: Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS 1979), pp. 169\u2013171 (1979)","DOI":"10.1109\/SFCS.1979.45"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1145\/5505.5507","volume":"17","author":"JH Hester","year":"1985","unstructured":"Hester, J.H., Hirschberg, D.S.: Self-organizing linear search. ACM Comput. Surv. 17, 285\u2013311 (1985)","journal-title":"ACM Comput. Surv."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"DE Knuth","year":"1975","unstructured":"Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artifi. Intell. 6, 293\u2013326 (1975)","journal-title":"Artifi. Intell."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Levene, M., Bar-Ilan, J.: Comparing typical opening move choices made by humans and chess engines. Computing Research Repository (2006)","DOI":"10.1093\/comjnl\/bxm025"},{"key":"2_CR9","unstructured":"Luckhardt, C., Irani, K.: An algorithmic solution of n-person games. In: Proceedings of the AAAI 1986, pp. 158\u2013162 (1986)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Papadoupoulus, A.: Exploring optimization strategies in board game abalone for alpha-beta search. In: Proceedings of the 2012 IEEE Conference on Computational Intelligence and Games (CIG 2012), pp. 63\u201370 (2012)","DOI":"10.1109\/CIG.2012.6374139"},{"key":"2_CR11","unstructured":"Pettie, S.: Splay trees, davenport-schinzel sequences, and the deque conjecture. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2008)"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-02621-3_9","volume-title":"Research and Development in Intelligent Systems XXX","author":"S Polk","year":"2013","unstructured":"Polk, S., Oommen, B.J.: On applying adaptive data structures to multi-player game playing. In: Bramer, M., Petridis, M. (eds.) Research and Development in Intelligent Systems XXX, pp. 125\u2013138. Springer, Heidelberg (2013)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Polk, S., Oommen, B.J.: On enhancing recent multi-player game playing strategies using a spectrum of adaptive data structures. In: Proceedings of the 2013 Conference on Technologies and Applications of Artificial Intelligence (TAAI 2013) (2013)","DOI":"10.1109\/TAAI.2013.42"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-24069-5_21","volume-title":"Computational Collective Intelligence","author":"S Polk","year":"2015","unstructured":"Polk, S., Oommen, B.J.: Enhancing history-based move ordering in game playing using adaptive data structures. In: N\u00fa\u00f1ez, M., Nguyen, N.T., Camacho, D., Trawi\u0144ski, B. (eds.) ICCCI 2015. LNCS, vol. 9329, pp. 225\u2013235. Springer, Heidelberg (2015). doi:10.1007\/978-3-319-24069-5_21"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-3-319-19066-2_4","volume-title":"Current Approaches in Applied Artificial Intelligence","author":"S Polk","year":"2015","unstructured":"Polk, S., Oommen, B.J.: Novel AI strategies for multi-player games at intermediate board states. In: Ali, M., Kwon, Y.S., Lee, C.-H., Kim, J., Kim, Y. (eds.) IEA\/AIE 2015. LNCS, vol. 9101, pp. 33\u201342. Springer, Heidelberg (2015)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Polk, S., Oommen, B.J.: Space and depth-related enhancements of the history-ADS strategy in game playing. In: Proceedings of the 2015 IEEE Conference on Computational Intelligence and Games (CIG 2015) (2015)","DOI":"10.1109\/CIG.2015.7317956"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1109\/34.297950","volume":"16","author":"A Reinefeld","year":"1994","unstructured":"Reinefeld, A., Marsland, T.A.: Enhanced iterative-deepening search. IEEE Trans. Pattern Anal. Mach. Intell. 16, 701\u2013710 (1994)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Rendell, P.: A universal turing machine in conway\u2019s game of life. In: Proceedings of the International Conference on High Performance Computing and Simulation (HPCS 2011), pp. 764\u2013772 (2011)","DOI":"10.1109\/HPCSim.2011.5999906"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Rivest, R.L.: On self-organizing sequential search heuristics. In: Proceedings of the IEEE Symposium on Switching and Automata Theory, pp. 63\u201367 (1974)","DOI":"10.1145\/359997.360000"},{"key":"2_CR20","volume-title":"Artificial Intelligence: A Modern Approach","author":"SJ Russell","year":"2009","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Prentice-Hall Inc., Upper Saddle River (2009)","edition":"3"},{"key":"2_CR21","volume-title":"A Gamut of Games","author":"S Sacksin","year":"1969","unstructured":"Sacksin, S.: A Gamut of Games. Random House, New York (1969)"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TCIAIG.2011.2107323","volume":"3","author":"MPD Schadd","year":"2011","unstructured":"Schadd, M.P.D., Winands, M.H.M.: Best reply search for multiplayer games. IEEE Trans. Comput. Intell. AI Games 3, 57\u201366 (2011)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/34.42858","volume":"11","author":"J Schaeffer","year":"1989","unstructured":"Schaeffer, J.: The history heuristic and alpha-beta search enhancements in practice. IEEE Trans. Pattern Anal. Mach. Intell. 11, 1203\u20131212 (1989)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2_CR24","unstructured":"Schrder, E.: Move ordering in rebel. Discussion of move ordering techniques used in REBEL, a powerful chess engine (2007)"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1080\/14786445008521796","volume":"41","author":"CE Shannon","year":"1950","unstructured":"Shannon, C.E.: Programming a computer for playing Chess. Phil. Mag. 41, 256\u2013275 (1950)","journal-title":"Phil. Mag."},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28, 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-40031-8_8","volume-title":"Computers and Games","author":"NR Sturtevant","year":"2003","unstructured":"Sturtevant, N.R.: A comparison of algorithms for multi-player games. In: Schaeffer, J., M\u00fcller, M., Bj\u00f6rnsson, Y. (eds.) CG 2002. LNCS, vol. 2883, pp. 108\u2013122. Springer, Heidelberg (2003)"},{"key":"2_CR28","unstructured":"Sturtevant, N., Games, M.-P.: Algorithms and Approaches. Ph.D. thesis, University of California (2003)"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Sturtevant, N., Bowling, M.: Robust game play against unknown opponents. In: Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), pp. 713\u2013719 (2006)","DOI":"10.1145\/1160633.1160761"},{"key":"2_CR30","unstructured":"Sturtevant, N., Zinkevich, M., Bowling, M.: Prob-Maxn: playing n-player games with opponent models. In: Proceedings of the National Conference on Artificial Intelligence (AAAI 2006), pp. 1057\u20131063 (2006)"},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-12993-3_3","volume-title":"Advances in Computer Games","author":"I Szita","year":"2010","unstructured":"Szita, I., Chaslot, G., Spronck, P.: Monte-carlo tree search in settlers of catan. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol. 6048, pp. 21\u201332. Springer, Heidelberg (2010)"},{"key":"2_CR32","unstructured":"Zuckerman, I., Felner, A., Kraus, S.: Mixing search strategies for multi-player games. In Proceedings of the Twenty-first International Joint Conferences on Artificial Intelligence (IJCAI 2009), pp. 646\u2013651 (2009)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Computational Collective Intelligence XXII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49619-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T14:45:48Z","timestamp":1748789148000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-49619-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496183","9783662496190"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49619-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}