{"id":"https://openalex.org/W4417307721","doi":"https://doi.org/10.2197/ipsjjip.33.1101","title":"Sokoban-style PushPush Games with Unique Solutions","display_name":"Sokoban-style PushPush Games with Unique Solutions","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4417307721","doi":"https://doi.org/10.2197/ipsjjip.33.1101"},"language":"en","primary_location":{"id":"doi:10.2197/ipsjjip.33.1101","is_oa":true,"landing_page_url":"https://doi.org/10.2197/ipsjjip.33.1101","pdf_url":"https://www.jstage.jst.go.jp/article/ipsjjip/33/0/33_1101/_pdf","source":{"id":"https://openalex.org/S4210239267","display_name":"Journal of Information Processing","issn_l":"1882-6652","issn":["1882-6652"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information Processing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.jstage.jst.go.jp/article/ipsjjip/33/0/33_1101/_pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058258777","display_name":"Robert D. Barish","orcid":"https://orcid.org/0000-0001-5207-0375"},"institutions":[{"id":"https://openalex.org/I4210098918","display_name":"Tokyo Metropolitan Institute of Medical Science","ror":"https://ror.org/00vya8493","country_code":"JP","type":"facility","lineage":["https://openalex.org/I4210098918"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Robert D. Barish","raw_affiliation_strings":["Division of Medical Data Informatics, Human Genome Center, Institute of Medical Science, The University of Tokyo"],"affiliations":[{"raw_affiliation_string":"Division of Medical Data Informatics, Human Genome Center, Institute of Medical Science, The University of Tokyo","institution_ids":["https://openalex.org/I4210098918"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043159528","display_name":"Tetsuo Shibuya","orcid":"https://orcid.org/0000-0003-1514-5766"},"institutions":[{"id":"https://openalex.org/I4210098918","display_name":"Tokyo Metropolitan Institute of Medical Science","ror":"https://ror.org/00vya8493","country_code":"JP","type":"facility","lineage":["https://openalex.org/I4210098918"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tetsuo Shibuya","raw_affiliation_strings":["Division of Medical Data Informatics, Human Genome Center, Institute of Medical Science, The University of Tokyo"],"affiliations":[{"raw_affiliation_string":"Division of Medical Data Informatics, Human Genome Center, Institute of Medical Science, The University of Tokyo","institution_ids":["https://openalex.org/I4210098918"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058258777"],"corresponding_institution_ids":["https://openalex.org/I4210098918"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20885929,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"0","first_page":"1101","last_page":"1109"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.7843999862670898,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.7843999862670898,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.0333000011742115,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.024700000882148743,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/uniqueness","display_name":"Uniqueness","score":0.5625},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5042999982833862},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4896000027656555},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4587000012397766},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4316999912261963},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4212999939918518},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.40470001101493835},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.40400001406669617}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7487000226974487},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.5625},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5042999982833862},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49950000643730164},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4896000027656555},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4587000012397766},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4316999912261963},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4212999939918518},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.40470001101493835},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.40400001406669617},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.38199999928474426},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3806999921798706},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.37700000405311584},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.3490000069141388},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3488999903202057},{"id":"https://openalex.org/C2781204021","wikidata":"https://www.wikidata.org/wiki/Q6497091","display_name":"Lattice (music)","level":2,"score":0.3240000009536743},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.3176000118255615},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30649998784065247},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.30140000581741333},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.2624000012874603},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2603999972343445}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2197/ipsjjip.33.1101","is_oa":true,"landing_page_url":"https://doi.org/10.2197/ipsjjip.33.1101","pdf_url":"https://www.jstage.jst.go.jp/article/ipsjjip/33/0/33_1101/_pdf","source":{"id":"https://openalex.org/S4210239267","display_name":"Journal of Information Processing","issn_l":"1882-6652","issn":["1882-6652"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information Processing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.2197/ipsjjip.33.1101","is_oa":true,"landing_page_url":"https://doi.org/10.2197/ipsjjip.33.1101","pdf_url":"https://www.jstage.jst.go.jp/article/ipsjjip/33/0/33_1101/_pdf","source":{"id":"https://openalex.org/S4210239267","display_name":"Journal of Information Processing","issn_l":"1882-6652","issn":["1882-6652"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information Processing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2879543046","display_name":null,"funder_award_id":"21H05052","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G3670916553","display_name":null,"funder_award_id":"21H05","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G5850052687","display_name":null,"funder_award_id":"23K18501","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G942612037","display_name":null,"funder_award_id":"20H05967","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4417307721.pdf","grobid_xml":"https://content.openalex.org/works/W4417307721.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W117707387","https://openalex.org/W1491169489","https://openalex.org/W1991572458","https://openalex.org/W1995621089","https://openalex.org/W2044504659","https://openalex.org/W2052218573","https://openalex.org/W2057512592","https://openalex.org/W2087818742","https://openalex.org/W2117205241","https://openalex.org/W2505717425","https://openalex.org/W2911695748","https://openalex.org/W4220728390","https://openalex.org/W4245608944","https://openalex.org/W4400650105"],"related_works":[],"abstract_inverted_index":{"Based":[0],"on":[1,14,34],"the":[2,8,11,29,50,62,79,95,152,164,168],"1994":[3],"Macintosh":[4],"computer":[5],"game":[6,141],"of":[7,70,81,85,154,161,167,171,192],"same":[9],"name,":[10],"PushPush":[12],"variation":[13],"Sokoban,":[15],"which":[16,28],"we":[17,77,106,180],"refer":[18],"to":[19,47,49,57,65,98,120],"as":[20],"PushPush-Storage,":[21],"is":[22,64,97],"a":[23,43,67,100,140,145,158,174],"block":[24,44],"pushing":[25,42],"puzzle":[26,148,169],"in":[27],"player":[30,96,175],"controls":[31],"an":[32,35],"agent":[33],"integer":[36],"lattice":[37],"populated":[38],"with":[39,73],"blocks,":[40,59],"where":[41,61,88],"causes":[45],"it":[46],"slide":[48],"maximum":[51],"possible":[52],"extent":[53],"without":[54],"momentum":[55],"transfer":[56],"other":[58],"and":[60,149,170,189],"objective":[63],"cover":[66],"fixed":[68],"set":[69],"storage":[71],"sites":[72],"unmoving":[74],"blocks.":[75],"Here,":[76],"consider":[78],"problem":[80],"designing":[82],"non-trivial":[83],"instances":[84],"PushPush-Storage":[86,123,147,183],"puzzles":[87,124,184],"one":[89],"can":[90,117,143],"easily":[91],"quantify":[92],"how":[93],"close":[94],"finding":[99],"given":[101],"solution.":[102],"Towards":[103],"this":[104],"objective,":[105],"show":[107],"that":[108,182],"randomized":[109],"polynomial":[110,132],"time":[111,133],"reductions":[112],"from":[113],"Boolean":[114],"satisfiability":[115],"problems":[116],"be":[118],"used":[119],"efficiently":[121],"construct":[122],"having":[125],"unique":[126],"solutions":[127],"while":[128],"also":[129],"not":[130],"admitting":[131],"algorithms":[134],"unless":[135],"NP":[136],"=RP.":[137],"Accordingly,":[138],"provided":[139],"designer":[142],"find":[144],"solvable":[146],"its":[150,155],"solution,":[151],"uniqueness":[153],"solution":[156],"provides":[157],"direct":[159],"means":[160],"both":[162],"quantifying":[163],"percentage":[165],"completion":[166],"determining":[172],"if":[173],"has":[176],"become":[177],"trapped.":[178],"Finally,":[179],"establish":[181],"are":[185],"hard":[186],"for":[187],"Ueda":[188],"Nagao's":[190],"class":[191],"Another":[193],"Solution":[194],"Problem":[195],"(ASP)":[196],"function":[197],"problems.":[198]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-12-14T00:00:00"}
