{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:39:23Z","timestamp":1743064763305,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642384561"},{"type":"electronic","value":"9783642384578"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-38457-8_4","type":"book-chapter","created":{"date-parts":[[2013,5,7]],"date-time":"2013-05-07T00:57:34Z","timestamp":1367888254000},"page":"40-51","source":"Crossref","is-referenced-by-count":0,"title":["Move Pruning and Duplicate Detection"],"prefix":"10.1007","author":[{"given":"Robert C.","family":"Holte","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Burch, N., Holte, R.C.: Automatic move pruning revisted. In: Proceedings of the 5th Symposium on Combinatorial Search, SoCS (2012)"},{"key":"4_CR2","unstructured":"Burch, N., Holte, R.C.: Automatic move pruning in general single-player games. In: Proceedings of the 4th Symposium on Combinatorial Search, SoCS (2011)"},{"key":"4_CR3","unstructured":"Taylor, L.A.: Pruning duplicate nodes in depth-first search. Technical Report CSD-920049, UCLA Computer Science Department (1992)"},{"key":"4_CR4","unstructured":"Taylor, L.A., Korf, R.E.: Pruning duplicate nodes in depth-first search. In: AAAI, pp. 756\u2013761 (1993)"},{"issue":"7","key":"4_CR5","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.\u00a016(7), 701\u2013710 (1994)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"4_CR6","unstructured":"Korf, R.E.: Finding optimal solutions to Rubik\u2019s Cube using pattern databases. In: AAAI, pp. 700\u2013705 (1997)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Helmert, M., Lasinger, H.: The scanalyzer domain: Greenhouse logistics as a planning problem. In: ICAPS, pp. 234\u2013237 (2010)","DOI":"10.1609\/icaps.v20i1.13431"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38457-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T14:36:14Z","timestamp":1688222174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38457-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642384561","9783642384578"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38457-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}