{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T20:10:01Z","timestamp":1746303001997,"version":"3.40.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319091648"},{"type":"electronic","value":"9783319091655"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09165-5_16","type":"book-chapter","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T13:56:50Z","timestamp":1405087010000},"page":"187-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Material Symmetry to Partition Endgame Tables"],"prefix":"10.1007","author":[{"given":"Abdallah","family":"Saffidine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Jouandeau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9dric","family":"Buron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tristan","family":"Cazenave","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,12]]},"reference":[{"key":"16_CR1","unstructured":"Buro, M., Long, J.R., Furtak, T., Sturtevant, N.: Improving state evaluation, inference, and search in trick-based card games. In: 21st International Joint Conference on Artificial Intelligence (IJCAI 2009) (2009)"},{"key":"16_CR2","first-page":"275","volume":"9","author":"T Cazenave","year":"2001","unstructured":"Cazenave, T.: Generation of patterns with external conditions for the game of go. Adv. Comput. Games 9, 275\u2013293 (2001)","journal-title":"Adv. Comput. Games"},{"issue":"2","key":"16_CR3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3233\/ICG-2010-33204","volume":"33","author":"B-N Chen","year":"2010","unstructured":"Chen, B.-N., Shen, B.-J., Hsu, T.: Chinese dark chess. ICGA J. 33(2), 93 (2010)","journal-title":"ICGA J."},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-12993-3_13","volume-title":"Advances in Computer Games","author":"P Ciancarini","year":"2010","unstructured":"Ciancarini, P., Favini, G.P.: Solving kriegspiel endings with brute force: the case of KR vs. K. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol. 6048, pp. 136\u2013145. Springer, Heidelberg (2010)"},{"issue":"3","key":"16_CR5","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1111\/0824-7935.00065","volume":"14","author":"JC Culberson","year":"1998","unstructured":"Culberson, J.C., Schaeffer, J.: Pattern databases. Comput. Intell. 14(3), 318\u2013334 (1998)","journal-title":"Comput. Intell."},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/3-540-45579-5_7","volume-title":"Computers and Games","author":"H Fang","year":"2002","unstructured":"Fang, H., Hsu, T., Hsu, S.-C.: Construction of Chinese Chess endgame databases by retrograde analysis. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, pp. 96\u2013114. Springer, Heidelberg (2002)"},{"key":"16_CR7","unstructured":"Furtak, T., Buro, M.: Using payoff-similarity to speed up search. In: 22nd International Joint Conference on Artificial Intelligence (IJCAI2011), pp. 534\u2013539. AAAI Press (2011)"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1111\/j.1467-8640.1996.tb00251.x","volume":"12","author":"R Gasser","year":"1996","unstructured":"Gasser, R.: Solving nine men\u2019s morris. Comput. Intell. 12(1), 24\u201341 (1996)","journal-title":"Comput. Intell."},{"key":"16_CR9","unstructured":"Ginsberg, M.L.: Partition search. In: National Conference On Artificial Intelligence (AAAI1996), pp. 228\u2013233 (1996)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/10968987_2","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"M Goldenberg","year":"2003","unstructured":"Goldenberg, M., Lu, P., Schaeffer, J.: TrellisDAG: a system for structured DAG scheduling. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol. 2862, pp. 21\u201343. Springer, Heidelberg (2003)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-75538-8_12","volume-title":"Computers and Games","author":"S Kupferschmid","year":"2007","unstructured":"Kupferschmid, S., Helmert, M.: A skat player based on Monte-Carlo simulation. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 135\u2013147. Springer, Heidelberg (2007)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: 2001 Proceedings of IEEE International Conference on Data Mining, ICDM 2001, pp. 313\u2013320. IEEE (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"16_CR13","unstructured":"Long, J.R.: Search, inference and opponent modelling in an expert-caliber skat player, PhD thesis, University of Alberta (2011)"},{"issue":"3","key":"16_CR14","doi-asserted-by":"crossref","first-page":"148","DOI":"10.3233\/ICG-2000-23304","volume":"23","author":"EV Nalimov","year":"2000","unstructured":"Nalimov, E.V., Haworth, G.M., Heinz, E.A.: Space-efficient indexing of chess endgame tables. ICGA J. 23(3), 148\u2013162 (2000)","journal-title":"ICGA J."},{"issue":"10","key":"16_CR15","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/MC.2003.1236468","volume":"36","author":"J Romein","year":"2003","unstructured":"Romein, J., Bal, H.E.: Solving awari with parallel retrograde analysis. Computer 36(10), 26\u201333 (2003)","journal-title":"Computer"},{"issue":"3","key":"16_CR16","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1142\/S1793005708001124","volume":"4","author":"MPD Schadd","year":"2008","unstructured":"Schadd, M.P.D., Winands, M.H.M., Uiterwijk, J.W.H.M., Van Den Herik, H.J., Bergsma, M.H.J.: Best play in fanorona leads to draw. New Math. Nat. Comput. 4(3), 369\u2013387 (2008)","journal-title":"New Math. Nat. Comput."},{"key":"16_CR17","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-0-387-35706-5_13","volume-title":"Advances in Computer Games","author":"J Schaeffer","year":"2004","unstructured":"Schaeffer, J., Bj\u00f6rnsson, Y., Burch, N., Lake, R., Sutphen, S.: Building the checkers 10-piece endgame databases. In: Van Den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Many Games, Many Challenges. IFIP, vol. 135, pp. 193\u2013210. Springer, Heidelberg (2004)"},{"issue":"5844","key":"16_CR18","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1126\/science.1144079","volume":"317","author":"J Schaeffer","year":"2007","unstructured":"Schaeffer, J., Burch, N., Bj\u00f6rnsson, Y., Kishimoto, A., M\u00fcller, M., Lake, R., Paul, L., Sutphen, S.: Checkers is solved. Science 317(5844), 1518\u20131522 (2007)","journal-title":"Science"},{"issue":"3","key":"16_CR19","first-page":"131","volume":"9","author":"K Thompson","year":"1986","unstructured":"Thompson, K.: Retrograde analysis of certain endgames. ICCA J. 9(3), 131\u2013139 (1986)","journal-title":"ICCA J."},{"issue":"4","key":"16_CR20","first-page":"215","volume":"19","author":"K Thompson","year":"1996","unstructured":"Thompson, K.: 6-piece endgames. ICCA J. 19(4), 215\u2013226 (1996)","journal-title":"ICCA J."},{"issue":"1","key":"16_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JD Ullmann","year":"1976","unstructured":"Ullmann, J.D.: An algorithm for subgraph isomorphism. J. ACM (JACM) 23(1), 31\u201342 (1976)","journal-title":"J. ACM (JACM)"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09165-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T19:36:24Z","timestamp":1746300984000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09165-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091648","9783319091655"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09165-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"12 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}