{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:36:04Z","timestamp":1740148564302,"version":"3.37.3"},"reference-count":16,"publisher":"Wiley","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key Basic Research Program of China","award":["2013CB329103","2013CB329100","NSFC-61173129","61472053","91420102","CDJXS11182240","CDJXS11180004"],"award-info":[{"award-number":["2013CB329103","2013CB329100","NSFC-61173129","61472053","91420102","CDJXS11182240","CDJXS11180004"]}]},{"name":"National Key Basic Research Program of China","award":["2013CB329103","2013CB329100","NSFC-61173129","61472053","91420102","CDJXS11182240","CDJXS11180004"],"award-info":[{"award-number":["2013CB329103","2013CB329100","NSFC-61173129","61472053","91420102","CDJXS11182240","CDJXS11180004"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2013CB329103","2013CB329100","NSFC-61173129","61472053","91420102","CDJXS11182240","CDJXS11180004"],"award-info":[{"award-number":["2013CB329103","2013CB329100","NSFC-61173129","61472053","91420102","CDJXS11182240","CDJXS11180004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2013CB329103","2013CB329100","NSFC-61173129","61472053","91420102","CDJXS11182240","CDJXS11180004"],"award-info":[{"award-number":["2013CB329103","2013CB329100","NSFC-61173129","61472053","91420102","CDJXS11182240","CDJXS11180004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2013CB329103","2013CB329100","NSFC-61173129","61472053","91420102","CDJXS11182240","CDJXS11180004"],"award-info":[{"award-number":["2013CB329103","2013CB329100","NSFC-61173129","61472053","91420102","CDJXS11182240","CDJXS11180004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fundamental Research Funds for the Central University","award":["2013CB329103","2013CB329100","NSFC-61173129","61472053","91420102","CDJXS11182240","CDJXS11180004"],"award-info":[{"award-number":["2013CB329103","2013CB329100","NSFC-61173129","61472053","91420102","CDJXS11182240","CDJXS11180004"]}]},{"name":"Fundamental Research Funds for the Central University","award":["2013CB329103","2013CB329100","NSFC-61173129","61472053","91420102","CDJXS11182240","CDJXS11180004"],"award-info":[{"award-number":["2013CB329103","2013CB329100","NSFC-61173129","61472053","91420102","CDJXS11182240","CDJXS11180004"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Games Technology"],"published-print":{"date-parts":[[2016]]},"abstract":"<jats:p>War chess gaming has so far received insufficient attention but is a significant component of turn-based strategy games (TBS) and is studied in this paper. First, a common game model is proposed through various existing war chess types. Based on the model, we propose a theory frame involving combinational optimization on the one hand and game tree search on the other hand. We also discuss a key problem, namely, that the number of the branching factors of each turn in the game tree is huge. Then, we propose two algorithms for searching in one turn to solve the problem: (<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\"><mml:mrow><mml:mn fontstyle=\"italic\">1<\/mml:mn><\/mml:mrow><\/mml:math>) enumeration by order; (<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\"><mml:mrow><mml:mn fontstyle=\"italic\">2<\/mml:mn><\/mml:mrow><\/mml:math>) enumeration by recursion. The main difference between these two is the permutation method used: the former uses the dictionary sequence method, while the latter uses the recursive permutation method. Finally, we prove that both of these algorithms are optimal, and we analyze the difference between their efficiencies. An important factor is the total time taken for the unit to expand until it achieves its reachable position. The factor, which is the total number of expansions that each unit makes in its reachable position, is set. The conclusion proposed is in terms of this factor: Enumeration by recursion is better than enumeration by order in all situations.<\/jats:p>","DOI":"10.1155\/2016\/5216861","type":"journal-article","created":{"date-parts":[[2016,3,3]],"date-time":"2016-03-03T16:04:00Z","timestamp":1457021040000},"page":"1-14","source":"Crossref","is-referenced-by-count":3,"title":["Turn-Based War Chess Model and Its Search Algorithm per Turn"],"prefix":"10.1155","volume":"2016","author":[{"given":"Hai","family":"Nan","sequence":"first","affiliation":[{"name":"College of Computer Science, Chongqing University, Chongqing 400044, China"},{"name":"Department of Software Engineering, Chongqing Institute of Engineering, Chongqing 400056, China"}]},{"given":"Bin","family":"Fang","sequence":"additional","affiliation":[{"name":"College of Computer Science, Chongqing University, Chongqing 400044, China"}]},{"given":"Guixin","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Software Engineering, Chongqing Institute of Engineering, Chongqing 400056, China"}]},{"given":"Weibin","family":"Yang","sequence":"additional","affiliation":[{"name":"College of Automation, Chongqing University, Chongqing 400044, China"}]},{"given":"Emily","family":"Sarah Carruthers","sequence":"additional","affiliation":[{"name":"College of International Education, Chongqing University, Chongqing 400044, China"}]},{"given":"Yi","family":"Liu","sequence":"additional","affiliation":[{"name":"PetroChina Chongqing Marketing Jiangnan Company, Chongqing 400060, China"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1996.tb00250.x"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0536-y"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2220138"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/tciaig.2010.2061050"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2210424"},{"issue":"8","key":"11","first-page":"38","volume":"31","year":"2012","journal-title":"Ordnance Industry Automation"},{"journal-title":"Progress of Artificial Intelligence in China","first-page":"748","year":"2009","key":"20"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/tciaig.2014.2309077"},{"issue":"2","key":"15","first-page":"102","volume":"26","year":"2011","journal-title":"Journal of Tibet University (Natural Science Edition)"},{"issue":"6","key":"16","first-page":"961","volume":"27","year":"2006","journal-title":"Mini-Micro Systems"},{"key":"18","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1613\/jair.4117","volume":"48","year":"2013","journal-title":"Journal of Artificial Intelligence Research"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/356689.356692"},{"year":"2012","key":"23"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/6.3.293"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1145\/359997.360002"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.11.006"}],"container-title":["International Journal of Computer Games Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/ijcgt\/2016\/5216861.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/ijcgt\/2016\/5216861.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/ijcgt\/2016\/5216861.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T02:36:04Z","timestamp":1567650964000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/ijcgt\/2016\/5216861\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":16,"alternative-id":["5216861","5216861"],"URL":"https:\/\/doi.org\/10.1155\/2016\/5216861","relation":{},"ISSN":["1687-7047","1687-7055"],"issn-type":[{"type":"print","value":"1687-7047"},{"type":"electronic","value":"1687-7055"}],"subject":[],"published":{"date-parts":[[2016]]}}}