{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T21:05:32Z","timestamp":1758229532784,"version":"3.44.0"},"reference-count":0,"publisher":"Association for the Advancement of Artificial Intelligence (AAAI)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ICAPS"],"abstract":"<jats:p>We introduce a new version of general game-playing in which one of the players chooses the length of the game up front.\nConsider a classical planning problem and two players who take turns applying actions.\nPlayer 1 wins iff the goal is true after a predetermined number of moves has been made.\nIs there a number r such that player 1 has a winning strategy for the game of length r?\nWe show that this problem is EXPSPACE-complete.\nMoreover, we show that the problem is equivalent to the plan existence problem for a class of fully observable non-deterministic hierarchical task network planning problems under the solution concept with fixed methods, which was introduced in prior work.\nThis class consists of all regular loop-unrolling problems, where a problem is loop-unrolling if it has at most one compound task name and at most two methods.\nAs a corollary, we obtain hardness for regular problems, solving an open problem.<\/jats:p>","DOI":"10.1609\/icaps.v35i1.36100","type":"journal-article","created":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T22:28:53Z","timestamp":1758061733000},"page":"45-53","source":"Crossref","is-referenced-by-count":0,"title":["Hardness of Chosen Length Planning Games and Regular Fixed Methods FOND HTN Planning"],"prefix":"10.1609","volume":"35","author":[{"given":"P. Maurice","family":"Dekker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregor","family":"Behnke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"9382","published-online":{"date-parts":[[2025,9,16]]},"container-title":["Proceedings of the International Conference on Automated Planning and Scheduling"],"original-title":[],"link":[{"URL":"https:\/\/ojs.aaai.org\/index.php\/ICAPS\/article\/download\/36100\/38254","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ojs.aaai.org\/index.php\/ICAPS\/article\/download\/36100\/38254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T22:28:53Z","timestamp":1758061733000},"score":1,"resource":{"primary":{"URL":"https:\/\/ojs.aaai.org\/index.php\/ICAPS\/article\/view\/36100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,16]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,9,16]]}},"URL":"https:\/\/doi.org\/10.1609\/icaps.v35i1.36100","relation":{},"ISSN":["2334-0843","2334-0835"],"issn-type":[{"type":"electronic","value":"2334-0843"},{"type":"print","value":"2334-0835"}],"subject":[],"published":{"date-parts":[[2025,9,16]]}}}