{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:39Z","timestamp":1750307019245,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,3,29]],"date-time":"2012-03-29T00:00:00Z","timestamp":1332979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,3,29]]},"DOI":"10.1145\/2184512.2184526","type":"proceedings-article","created":{"date-parts":[[2012,4,17]],"date-time":"2012-04-17T12:53:22Z","timestamp":1334667202000},"page":"53-58","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding effective search strategies for the TwoBik puzzle"],"prefix":"10.1145","author":[{"given":"Colin","family":"Hemphill","sequence":"first","affiliation":[{"name":"Belmont University, Nashville, TN"}]},{"given":"Joshua","family":"Sheehy","sequence":"additional","affiliation":[{"name":"Belmont University, Nashville, TN"}]}],"member":"320","published-online":{"date-parts":[[2012,3,29]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Tatham S. 2010. Portable Puzzle Collection - Sixteen. DOI= http:\/\/www.chiark.greenend.org.uk\/~sgtatham\/puzzles\/java\/sixteen.html  Tatham S. 2010. Portable Puzzle Collection - Sixteen. DOI= http:\/\/www.chiark.greenend.org.uk\/~sgtatham\/puzzles\/java\/sixteen.html"},{"key":"e_1_3_2_1_2_1","unstructured":"Russell S. and Norvig P. 2010. Artificial Intelligence: a Modern Approach. Pearson Education Upper Saddle River NJ   Russell S. and Norvig P. 2010. Artificial Intelligence: a Modern Approach . Pearson Education Upper Saddle River NJ"},{"key":"e_1_3_2_1_3_1","volume-title":"Heuristic Search: Theory and Applications. Morgan Kaufmann","author":"Edelkamp S.","year":"2011","unstructured":"Edelkamp , S. and Schrodel , S . 2011 . Heuristic Search: Theory and Applications. Morgan Kaufmann , Waltham, MA . Edelkamp, S. and Schrodel, S. 2011. Heuristic Search: Theory and Applications. Morgan Kaufmann, Waltham, MA."},{"key":"e_1_3_2_1_4_1","unstructured":"ABsolver -- Arithmetic and Boolean Solver 2009. Sourceforge.net. DOI = http:\/\/absolver.sourceforge.net\/  ABsolver -- Arithmetic and Boolean Solver 2009. Sourceforge.net. DOI = http:\/\/absolver.sourceforge.net\/"},{"volume-title":"Finding Optimal Solutions to the Rubik's Cube Using Pattern Databases","author":"Korf R.","key":"e_1_3_2_1_5_1","unstructured":"Korf , R. 1997. Finding Optimal Solutions to the Rubik's Cube Using Pattern Databases . University of California , Los Angeles . DOI = http:\/\/www.cs.princeton.edu\/courses\/archive\/fall06\/cos402\/papers\/korfrubik.pdf Korf, R. 1997. Finding Optimal Solutions to the Rubik's Cube Using Pattern Databases. University of California, Los Angeles. DOI = http:\/\/www.cs.princeton.edu\/courses\/archive\/fall06\/cos402\/papers\/korfrubik.pdf"},{"key":"e_1_3_2_1_6_1","unstructured":"Mostow J. and Prieditis A. Discovering Admissible Heuristics by Abstracting and Optimizing: a Transformational Approach. DOI = http:\/\/web.mit.edu\/6.034\/wwwbob\/absolver.pdf   Mostow J. and Prieditis A. Discovering Admissible Heuristics by Abstracting and Optimizing: a Transformational Approach. DOI = http:\/\/web.mit.edu\/6.034\/wwwbob\/absolver.pdf"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1999.12005124"},{"key":"e_1_3_2_1_8_1","unstructured":"Romero C. Castillo J. and Bonet B. 2008. Multiple Symmetries in Sliding-Tile Puzzles: First Experiments. Sim\u00f3n Bol\u00edvar University  Romero C. Castillo J. and Bonet B. 2008. Multiple Symmetries in Sliding-Tile Puzzles: First Experiments. Sim\u00f3n Bol\u00edvar University"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.3390\/a5010018"}],"event":{"name":"ACM SE '12: ACM Southeast Regional Conference","sponsor":["ACM Association for Computing Machinery"],"location":"Tuscaloosa Alabama","acronym":"ACM SE '12"},"container-title":["Proceedings of the 50th Annual Southeast Regional Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2184512.2184526","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2184512.2184526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:11Z","timestamp":1750236551000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2184512.2184526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,29]]},"references-count":9,"alternative-id":["10.1145\/2184512.2184526","10.1145\/2184512"],"URL":"https:\/\/doi.org\/10.1145\/2184512.2184526","relation":{},"subject":[],"published":{"date-parts":[[2012,3,29]]},"assertion":[{"value":"2012-03-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}