{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T13:45:41Z","timestamp":1756993541003,"version":"3.41.0"},"publisher-location":"Cham","reference-count":77,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319635156"},{"type":"electronic","value":"9783319635163"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-63516-3_11","type":"book-chapter","created":{"date-parts":[[2018,4,5]],"date-time":"2018-04-05T03:43:39Z","timestamp":1522899819000},"page":"419-455","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Parallel A* for State-Space Search"],"prefix":"10.1007","author":[{"given":"Alex","family":"Fukunaga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adi","family":"Botea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuu","family":"Jinnai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akihiro","family":"Kishimoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,6]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Akagi, Y., Kishimoto, A., Fukunaga, A.: On transposition tables for singleagent search and planning: Summary of results. In: Proceedings of the 3rd Symposium on Combinatorial Search (SOCS), pp. 1\u20138 (2010)","DOI":"10.1609\/socs.v1i1.18164"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"B\u00e4ckstr\u00f6m, C., Nebel, B.: Complexity results for SAS+ planning. Computational Intelligence 11(4), 625\u2013655 (1995)","DOI":"10.1111\/j.1467-8640.1995.tb00052.x"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Bleiweiss, A.: GPU accelerated pathfinding. In: Proceedings of the EUROGRAPHICS\/ ACM SIGGRAPH Conference on Graphics Hardware 2008, Sarajevo, Bosnia and Herzegovina, 2008, pp. 65\u201374 (2008). https:\/\/doi.org\/10.2312\/EGGH\/EGGH08\/065-074 . http:\/\/dx.doi.org\/10.2312\/EGGH\/EGGH08\/065-074","DOI":"10.2312\/EGGH\/EGGH08\/065-074"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Burns, E., Lemons, S., Ruml, W., Zhou, R.: Best-first heuristic search for multicore machines. Journal of Artificial Intelligence Research (JAIR) 39, 689\u2013743 (2010)","DOI":"10.1613\/jair.3094"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Burns, E., Lemons, S., Zhou, R., Ruml, W.: Best-first heuristic search for multi-core machines. In: Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence IJCAI-09 (2009)","DOI":"10.1613\/jair.3094"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Burns, E.A., Hatem, M., Leighton, M.J., Ruml, W.: Implementing fast heuristic search code. pp. 25\u201332 (2012)","DOI":"10.1609\/socs.v3i1.18245"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Campbell, M., Hoane, J., Hsu, F.: Deep Blue. Artificial Intelligence 134(1-2), 57\u201383 (2002)","DOI":"10.1016\/S0004-3702(01)00129-1"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Cazenave, T., Jouandeau, N.: On the parallelization of UCT. In: H. van den Herik et al. (ed.) Proceedings of Computers and Games CG-08, LNCS, vol. 5131, pp. 72\u201380. Springer (2008)","DOI":"10.1007\/978-3-540-87608-3_7"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Chakrabarti, P., Ghose, S., Acharya, A., de Sarkar, S.: Heuristic search in restricted memory. Artificial Intelligence 41(2), 197\u2013221 (1989)","DOI":"10.1016\/0004-3702(89)90010-6"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Cook, D., Varnell, R.: Adaptive parallel iterative deepening search. Journal of Artificial Intelligence Research 9, 139\u2013166 (1998)","DOI":"10.1613\/jair.518"},{"key":"11_CR11","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, Second Edition. The MIT Press (2001). http:\/\/www.amazon.ca\/exec\/obidos\/redirect?tag=citeulike09-20{&}path=ASIN\/0262531968"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Dutt, S., Mahapatra, N.: Scalable load balancing strategies for parallel A* algorithms. Journal of parallel and distributed computing 22, 488\u2013505 (1994)","DOI":"10.1006\/jpdc.1994.1106"},{"key":"11_CR13","unstructured":"Edelkamp, S., Schroedl, S.: Heuristic Search: Theory and Applications. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2010)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Evett, M., Hendler, J., Mahanti, A., Nau, D.: PRA*: Massively parallel heuristic search. Journal of Parallel and Distributed Computing 25(2), 133\u2013143 (1995)","DOI":"10.1006\/jpdc.1995.1036"},{"key":"11_CR15","unstructured":"Feldmann, R.: Spielbaumsuche mit massiv parallelen Systemen. Ph.D. thesis University of Paderborn (1993). English translation titled Game tree search on massively parallel systems is available."},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Felner, A., Kraus, S., Korf, R.E.: Kbfs: K-best-first search. Annals of Mathematics and Artificial Intelligence 39, 19\u201339 (2003)","DOI":"10.1023\/A:1024452529781"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Frigo, M., Leiserson, C.E., Randall, K.H.: The implementation of the Cilk-5 multithreaded language. In: ACM SIGPLAN Conferences on Programming Language Design and Implementation (PLDI\u201998), pp. 212\u2013223 (1998)","DOI":"10.1145\/277650.277725"},{"key":"11_CR18","unstructured":"Fukunaga, A., Kishimoto, A., Botea, A.: Iterative resource allocation for memory intensive parallel search algorithms on clouds, grids, and shared clusters. In: Proceedings of the National Conference on Artificial Intelligence (AAAI) (2012). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI12\/paper\/view\/5054"},{"key":"11_CR19","unstructured":"Furcy, D., Koenig, S.: Limited discrepancy beam search. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 125\u2013131 (2005)"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Garavel, H., Mateescu, R., Smarandache, I.M.: Parallel state space construction for model-checking. In: Proceedings of the 8th International SPIN Workshop, pp. 217\u2013234 (2001)","DOI":"10.1007\/3-540-45139-0_14"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Gomes, C., Selman, B., Crato, N., Kautz, H.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning 24(1-2), 67\u2013100 (2000)","DOI":"10.1023\/A:1006314320276"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Hamadi, Y., Jabbour, S., Sais, L.: ManySAT: a parallel SAT solver. Journal on Satisfiability, Boolean Modeling and Computation 6, 245\u2013262 (2009)","DOI":"10.3233\/SAT190070"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on System Sciences and Cybernetics SSC-4(2), 100\u2013107 (1968)","DOI":"10.1109\/TSSC.1968.300136"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Helmert, M.: The Fast Downward planning system. Journal of Artificial Intelligence Research 26, 191\u2013246 (2006). https:\/\/doi.org\/10.1613\/jair.1705","DOI":"10.1613\/jair.1705"},{"key":"11_CR25","unstructured":"Helmert, M., Haslum, P., Hoffmann, J.: Flexible abstraction heuristics for optimal sequential planning. In: Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling ICAPS-07, pp. 176\u2013183 (2007)"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Heyman, T., Geist, D., Grumberg, O., Schuster, A.: Achieving scalability in parallel reachability analysis of very large circuits. In: Proceedings 12th International Conference on Computer Aided Verification, pp. 20\u201335 (2000)","DOI":"10.1007\/10722167_6"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Holzmann, G.J., Bo\u0161na\u010dki, D.: The design of a multicore extension of the SPIN model checker. IEEE Transactions on Software Engineering 33(10), 659\u2013674 (2007)","DOI":"10.1109\/TSE.2007.70724"},{"key":"11_CR28","unstructured":"Horie, S., Fukunaga, A.S.: Block-parallel IDA* for GPUs. In: Proceedings of the Tenth International Symposium on Combinatorial Search, Edited by Alex Fukunaga and Akihiro Kishimoto, 16-17 June 2017, Pittsburgh, Pennsylvania, USA., pp. 134\u2013138 (2017). https:\/\/aaai.org\/ocs\/index.php\/SOCS\/SOCS17\/paper\/view\/15801"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Huberman, B., Lukose, R., Hogg, T.: An economics approach to hard computational problems. Science 275(5296), 51\u201354 (1997)","DOI":"10.1126\/science.275.5296.51"},{"key":"11_CR30","unstructured":"Irani, K., Shih, Y.: Parallel A* and AO* algorithms: An optimality criterion and performance evaluation. In: International Conference on Parallel Processing, pp. 274\u2013277 (1986)"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Jinnai, Y., Fukunaga, A.: Abstract Zobrist hashing: An efficient work distribution method for parallel best-first search. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 717\u2013723 (2016)","DOI":"10.1609\/aaai.v30i1.10065"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Jinnai, Y., Fukunaga, A.: Automated creation of efficient work distribution functions for parallel best-first search. In: Proc. ICAPS (2016)","DOI":"10.1613\/jair.5225"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Jinnai, Y., Fukunaga, A.: On work distribution functions for parallel best-first search. Journal of Artificial Intelligence Research (2017). (to appear)","DOI":"10.1613\/jair.5225"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Karp, R., Zhang, Y.: A randomized parallel branch-and-bound procedure. In: Proceedings of the 20th ACM Symposium on Theory of Computing (STOC), pp. 290\u2013300 (1988)","DOI":"10.1145\/62212.62240"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"Karp, R., Zhang, Y.: Randomized parallel algorithms for backtrack search and branch-and-bound computation. Journal of the Association for Computing Machinery 40(3), 765\u2013789 (1993)","DOI":"10.1145\/174130.174145"},{"key":"11_CR36","doi-asserted-by":"publisher","unstructured":"Kishimoto, A., Fukunaga, A., Botea, A.: Evaluation of a simple, scalable, parallel best-first search strategy. Artificial Intelligence 195, 222\u2013248 (2013). https:\/\/doi.org\/10.1016\/j.artint.2012.10.007 . http:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370212001294","DOI":"10.1016\/j.artint.2012.10.007"},{"key":"11_CR37","unstructured":"Kishimoto, A., Fukunaga, A.S., Botea, A.: Scalable, parallel best-first search for optimal sequential planning. In: Proc. ICAPS, pp. 201\u2013208 (2009). http:\/\/aaai.org\/ocs\/index.php\/ICAPS\/ICAPS09\/paper\/view\/705"},{"key":"11_CR38","unstructured":"Knight, K.: Are many reactive agents better than a few deliberative ones? In: Proceedings of the 13th International Joint Conference on Artificial Intelligence, pp. 432\u2013437 (1993)"},{"key":"11_CR39","unstructured":"Knuth, D.E.: \u201cSorting and Searching\u201d, The Art of Computer Programming, vol. 3. Addison-Wesley (1973)"},{"key":"11_CR40","unstructured":"Kobayashi, Y., Kishimoto, A., Watanabe, O.: Evaluations of Hash Distributed A* in optimal sequence alignment. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp. 584\u2013590 (2011)"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Korf, R.: Depth-first iterative deepening: An optimal admissible tree search. Artificial Intelligence 97, 97\u2013109 (1985)","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"11_CR42","doi-asserted-by":"crossref","unstructured":"Korf, R.: Linear-Space Best-First Search. Artificial Intelligence 62(1), 41\u201378 (1993)","DOI":"10.1016\/0004-3702(93)90045-D"},{"key":"11_CR43","doi-asserted-by":"crossref","unstructured":"Korf, R.E., Felner, A.: Disjoint pattern database heuristics. Artificial Intelligence 134(1-2), 9\u201322 (2002)","DOI":"10.1016\/S0004-3702(01)00092-3"},{"key":"11_CR44","unstructured":"Korf, R.E., Zhang, W.: Divide-and-conquer frontier search applied to optimal sequence alignment. In: Proceedings of the 17th National Conference on Artificial Intelligence AAAI-00, pp. 910\u2013916 (2000)"},{"key":"11_CR45","doi-asserted-by":"crossref","unstructured":"Kumar, R., Mercer, E.G.: Load balancing parallel explicit state model checking. Electronic Notes in Theoretical Computer Science 128 (2005)","DOI":"10.1016\/j.entcs.2004.10.016"},{"key":"11_CR46","unstructured":"Kumar, V., Ramesh, K., Rao, V.N.: Parallel best-first search of state-space graphs: A summary of results. In: Proceedings of the 7th National Conference on Artificial Intelligence AAAI-88, pp. 122\u2013127 (1988)"},{"key":"11_CR47","doi-asserted-by":"crossref","unstructured":"Lerda, F., Sisto, R.: Distributed-memory model checking with SPIN. In: Theoretical and Practical Aspects of SPIN Model Checking, 5th and 6th International SPIN Workshops, Lecture Notes in Computer Science, vol. 1680, pp. 22\u201339 (1999)","DOI":"10.1007\/3-540-48234-2_3"},{"key":"11_CR48","doi-asserted-by":"crossref","unstructured":"Mahanti, A., Daniels, C.: A SIMD approach to parallel heuristic search. Artificial Intelligence 60, 243\u2013282 (1993)","DOI":"10.1016\/0004-3702(93)90003-T"},{"key":"11_CR49","doi-asserted-by":"crossref","unstructured":"Mahapatra, N., Dutt, S.: Scalable global and local hashing strategies for duplicate pruning in parallel A* graph search. IEEE Transactions on Parallel and Distributed Systems 8(7), 738\u2013756 (1997)","DOI":"10.1109\/71.598348"},{"key":"11_CR50","doi-asserted-by":"crossref","unstructured":"Mattern, F.: Algorithms for distributed termination detection. Distributed Computing 2(3), 161\u2013175 (1987)","DOI":"10.1007\/BF01782776"},{"key":"11_CR51","doi-asserted-by":"crossref","unstructured":"Melatti, I., Palmer, R., Sawaya, G., Yang, Y., Kirby, R.M., Gopalakrishnan, G.: Parallel and distributed model checking in Eddy. International Journal on Software Tools for Technology Transfer 11(1), 13\u201325 (2009)","DOI":"10.1007\/s10009-008-0094-x"},{"key":"11_CR52","unstructured":"Niewiadomski, R., Amaral, J.N., Holte, R.C.: Sequential and parallel algorithms for frontier A* with delayed duplicate detection. In: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI), pp. 1039\u20131044 (2006)"},{"key":"11_CR53","unstructured":"Pearl, J.: Heuristics - Intelligent Search Strategies for Computer Problem Solving. Addison\u2013Wesley (1984)"},{"key":"11_CR54","unstructured":"Phillips, M., Likhachev, M., Koenig, S.: PA*SE: Parallel A* for slow expansions. In: Proc. ICAPS (2014). http:\/\/www.aaai.org\/ocs\/index.php\/ICAPS\/ICAPS14\/paper\/view\/7952"},{"key":"11_CR55","doi-asserted-by":"crossref","unstructured":"Powley, C., Ferguson, C., Korf, R.: Depth-first heuristic search on a SIMD machine. Artificial Intelligence 60, 199\u2013242 (1993)","DOI":"10.1016\/0004-3702(93)90002-S"},{"key":"11_CR56","doi-asserted-by":"crossref","unstructured":"Powley, C., Korf, R.: Single-agent parallel window search. IEEE Transactions on Pattern Analysis and Machine Intelligence 13(5), 466\u2013477 (1991)","DOI":"10.1109\/34.134045"},{"key":"11_CR57","doi-asserted-by":"crossref","unstructured":"Rao, V.N., Kumar, V.: Parallel depth-first search on multiprocessors part I: Implementation. International Journal of Parallel Programming 16(6), 479\u2013499 (1987)","DOI":"10.1007\/BF01389000"},{"key":"11_CR58","doi-asserted-by":"crossref","unstructured":"Reinefeld, A., Marsland, T.: Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence 16(7), 701\u2013710 (1994)","DOI":"10.1109\/34.297950"},{"key":"11_CR59","doi-asserted-by":"crossref","unstructured":"Romein, J.W., Bal, H.E.: Wide-area transposition-driven scheduling. In: Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing, pp. 347\u2013355 (2001)","DOI":"10.1109\/HPDC.2001.945202"},{"key":"11_CR60","doi-asserted-by":"crossref","unstructured":"Romein, J.W., Bal, H.E., Schaeffer, J., Plaat, A.: A performance analysis of transposition-table-driven work scheduling in distributed search. IEEE Transactions on Parallel and Distributed Systems 13(5), 447\u2013459 (2002)","DOI":"10.1109\/TPDS.2002.1003855"},{"key":"11_CR61","unstructured":"Romein, J.W., Plaat, A., Bal, H.E., Schaeffer, J.: Transposition table driven work scheduling in distributed search. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 725\u2013731 (1999)"},{"key":"11_CR62","unstructured":"Romein, J.W., Plaat, A., Bal, H.E., Schaeffer, J.: Transposition table driven work scheduling in distributed search. In: Proceedings of the National Conference on Artificial Intelligence AAAI-99, pp. 725\u2013731 (1999)"},{"key":"11_CR63","unstructured":"Russell, S.: Efficient memory-bounded search methods. In: Proc. ECAI (1992)"},{"key":"11_CR64","doi-asserted-by":"crossref","unstructured":"Stern, U., Dill, D.L.: Parallelizing the Murphi verifier. In: Proceedings of the 9th International Conference on Computed Aided Verification, pp. 256\u2013278 (1997)","DOI":"10.1007\/3-540-63166-6_26"},{"key":"11_CR65","doi-asserted-by":"crossref","unstructured":"Stern, U., Dill, D.L.: Parallelizing the Murphi verifier. Formal Methods in System Design 18(2), 117\u2013129 (2001)","DOI":"10.1023\/A:1008771324652"},{"key":"11_CR66","unstructured":"Sulewski, D., Edelkamp, S., Kissmann, P.: Exploiting the computational power of the graphics card: Optimal state space planning on the GPU. In: Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 2011, Freiburg, Germany June 11-16, 2011 (2011). http:\/\/aaai.org\/ocs\/index.php\/ICAPS\/ICAPS11\/paper\/view\/2699"},{"key":"11_CR67","doi-asserted-by":"crossref","unstructured":"Valenzano, R., Nakhost, H., M\u00fcller, M., Schaeffer, J., Sturtevant, N.: Arvand- Herd: Parallel planning with a portfolio. In: Proceedings of the 20th European Conference on Artificial Intelligence, pp. 786\u2013791 (2012)","DOI":"10.3233\/978-1-61499-098-7-786"},{"key":"11_CR68","doi-asserted-by":"crossref","unstructured":"Valenzano, R., Sturtevant, N., Schaeffer, J., Buro, K., Kishimoto, A.: Simultaneously searching with multiple settings: An alternative to parameter tuning for suboptimal single-agent search algorithms. In: Proceedings of the 20th International Conference on Automated Planning and Scheduling, pp. 177\u2013184 (2010)","DOI":"10.1609\/icaps.v20i1.13423"},{"key":"11_CR69","doi-asserted-by":"crossref","unstructured":"Vidal, V., Bordeaux, L., Hamadi, Y.: Adaptive k-parallel best-first search: A simple but efficient algorithm for multi-core domain-independent planning. In: Proceedings of the 3rd Symposium on Combinatorial Search (SOCS\u201910) (2010)","DOI":"10.1609\/socs.v1i1.18165"},{"key":"11_CR70","doi-asserted-by":"crossref","unstructured":"Vrakas, D., Refanidis, I., Vlahavas, I.: Parallel planning via the distribution of operators. Journal of Experimental and Theoretical Artificial Intelligence 13(3), 211\u2013226 (2001)","DOI":"10.1080\/09528130110063074"},{"key":"11_CR71","unstructured":"Zhou, R., Hansen, E.: Domain-independent structured duplicate detection. In: Proceedings of the 21st National Conference on Artificial Intelligence AAAI-06, pp. 683\u2013688 (2006)"},{"key":"11_CR72","unstructured":"Zhou, R., Hansen, E.A.: Structured duplicate detection in external-memory graph search. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 683\u2013689 (2004)"},{"key":"11_CR73","doi-asserted-by":"crossref","unstructured":"Zhou, R., Hansen, E.A.: Breadth-first heuristic search. Artificial Intelligence 170(4), 385\u2013408 (2006)","DOI":"10.1016\/j.artint.2005.12.002"},{"key":"11_CR74","unstructured":"Zhou, R., Hansen, E.A.: Domain-independent structured duplicate detection. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 1082\u20131087 (2006)"},{"key":"11_CR75","unstructured":"Zhou, R., Hansen, E.A.: Parallel structured duplicate detection. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 1217\u20131223 (2007)"},{"key":"11_CR76","unstructured":"Zhou, Y., Zeng, J.: Massively parallel A* search on a GPU. In: Proceedings of the National Conference on Artificial Intelligence (AAAI), pp. 1248\u2013 1255 (2015). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI15\/paper\/view\/9620"},{"key":"11_CR77","unstructured":"Zobrist, A.L.: A new hashing method with application for game playing. reprinted in International Computer Chess Association Journal (ICCA) 13(2), 69\u201373 (1970)"}],"container-title":["Handbook of Parallel Constraint Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63516-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T12:49:01Z","timestamp":1751546941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63516-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319635156","9783319635163"],"references-count":77,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63516-3_11","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}