{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T04:37:16Z","timestamp":1767674236163,"version":"3.48.0"},"reference-count":11,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["ICGA Journal: The Journal of the Computer Games Community"],"published-print":{"date-parts":[[2020,1]]},"abstract":"<jats:p>San Jego is a two-player game with perfect information. It is a variation of the games Clobber (2001) and Cannibal Clobber. Given is a rectangular board with black and white pieces on the cells. Multiple pieces which are stacked on each other are called towers. The piece on top of a tower indicates her owner. A\u00a0move consists of picking an own tower and placing it completely on top of an adjacent tower. If both players can not move anymore, the game ends. Winner is the player with the highest tower. An upper bound for the state-space complexity of San Jego is determined. Furthermore, the game-tree complexity is approximated theoretically and numerically. For small board sizes, the optimal game-theoretic values are calculated and the advantage of the first move is determined.<\/jats:p>","DOI":"10.3233\/icg-200164","type":"journal-article","created":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T10:51:22Z","timestamp":1603191082000},"page":"257-271","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Analyzing a variant of Clobber: The game of San Jego"],"prefix":"10.1177","volume":"42","author":[{"given":"Raphael","family":"Thiele","sequence":"first","affiliation":[{"name":"Friedrich Schiller University","place":["Germany"]}]},{"given":"Ingo","family":"Alth\u00f6fer","sequence":"additional","affiliation":[{"name":"Friedrich Schiller University","place":["Germany"]}]}],"member":"179","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90004-3"},{"key":"e_1_3_3_3_1","unstructured":"Alth\u00f6fer I. (2015). San Jego. https:\/\/www.1000steine.de\/de\/gemeinschaft\/forum\/?entry=1&id=338936 last checked 02\/06\/2020."},{"key":"e_1_3_3_4_1","unstructured":"Claessen J. (2011). Combinatorial game theory in Clobber. Master\u2019s thesis Maastricht University. Supervised by Mark Winands."},{"key":"e_1_3_3_5_1","unstructured":"Feller W. (1970). An Introduction to Probability Theory and Its Applications (3rd ed. Vol.\u00a01). New York: Wiley."},{"key":"e_1_3_3_6_1","doi-asserted-by":"crossref","unstructured":"Larsson U. Nowakowski R.J. Neto J.P. & Santos C.P. (2016). Guaranteed scoring games. Electron. J. Comb. 23(3).","DOI":"10.37236\/5417"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00182-017-0590-x"},{"key":"e_1_3_3_8_1","unstructured":"Lasker E. (1931). Brettspiele der V\u00f6lker. Verlag August Scherl."},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0112059"},{"issue":"4","key":"e_1_3_3_10_1","first-page":"4","article-title":"An improvement of the scout tree search algorithm","volume":"6","author":"Reinefeld A.","year":"1983","unstructured":"Reinefeld, A. (1983). An improvement of the scout tree search algorithm. ICCA Journal, 6(4), 4\u201314.","journal-title":"ICCA Journal"},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","unstructured":"Spivey M.Z. (2019). The Art of Proving Binomial Identities. Chapman and Hall\/CRC. doi:10.1201\/9781351215824.","DOI":"10.1201\/9781351215824"},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2005-28316"}],"container-title":["ICGA Journal: The Journal of the Computer Games Community"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/ICG-200164","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/ICG-200164","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/ICG-200164","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T04:32:57Z","timestamp":1767673977000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/ICG-200164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["10.3233\/ICG-200164"],"URL":"https:\/\/doi.org\/10.3233\/icg-200164","relation":{},"ISSN":["1389-6911","2468-2438"],"issn-type":[{"type":"print","value":"1389-6911"},{"type":"electronic","value":"2468-2438"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}