{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T18:23:40Z","timestamp":1774549420724,"version":"3.50.1"},"reference-count":36,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2020,8,1]]},"DOI":"10.1587\/transinf.2019edp7295","type":"journal-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T22:16:37Z","timestamp":1596233797000},"page":"1901-1910","source":"Crossref","is-referenced-by-count":6,"title":["Graph Based Wave Function Collapse Algorithm for Procedural Content Generation in Games"],"prefix":"10.1587","volume":"E103.D","author":[{"given":"Hwanhee","family":"KIM","sequence":"first","affiliation":[{"name":"NCSOFT"}]},{"given":"Teasung","family":"HAHN","sequence":"additional","affiliation":[{"name":"NCSOFT"}]},{"given":"Sookyun","family":"KIM","sequence":"additional","affiliation":[{"name":"Jeju Naional University"}]},{"given":"Shinjin","family":"KANG","sequence":"additional","affiliation":[{"name":"Hongik University"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] World of Warcraft: https:\/\/worldofwarcraft.com\/, accessed 17 July 2019."},{"key":"2","unstructured":"[2] Blade and Soul: http:\/\/bns.plaync.com\/, accessed 17 July 2019."},{"key":"3","unstructured":"[3] No Man's Sky: https:\/\/www.nomanssky.com\/, accessed 17 July 2019."},{"key":"4","unstructured":"[4] Diablo3: https:\/\/us.diablo3.com\/en\/, accessed 17 July 2019."},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] I. Karth and A.M. Smith, \u201cWaveFunctionCollapse is constraint solving in the wild,\u201d Proc. 12th Int. Conf. Found. Digital Games, pp.1-10, ACM, 2017. 10.1145\/3102071.3110566","DOI":"10.1145\/3102071.3110566"},{"key":"6","unstructured":"[6] I. Karth and A.M. Smith, \u201cAddressing the fundamental tension of PCGML with discriminative learning,\u201d arXiv preprint arXiv:1809.04432, 2018."},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] M. Hendrikx, S. Meijer, J. Van Der Velden, and A. Iosup, \u201cProcedural content generation for games: A survey,\u201d ACM Trans. Multimed. Comput. Commun. Appl. (TOMM), 9, 1, 2013. 10.1145\/2422956.2422957","DOI":"10.1145\/2422956.2422957"},{"key":"8","unstructured":"[8] S. Snodgrass and S. Ontan, \u201cExperiments in map generation using Markov chains,\u201d Found. Digital Games, 2014."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] S. Snodgrass and S. Ontan, \u201cLearning to generate video game maps using Markov models,\u201d IEEE Trans. Emerg. Topics Comput. Intell., vol.9, pp.410-422, 2016.","DOI":"10.1109\/TCIAIG.2016.2623560"},{"key":"10","unstructured":"[10] S. Dahlskog, \u201cPatterns and procedural content generation in digital games: Automatic level generation for digital games using game design patterns,\u201d PhD dissertation, Faculty of Technology and Society, Malm\u00f6 University, 2016."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] A.J. Summerville, S. Philip, and M. Mateas, \u201cMcmcts pcg4 smb: Monte Carlo tree search to guide platformer level generation,\u201d 11th Artif. Intell. Interact. Digital Entertain. Conf., 2015.","DOI":"10.1609\/aiide.v11i3.12816"},{"key":"12","unstructured":"[12] S.E. Reed, Y. Zhang, Y. Zhang, and H. Lee, \u201cDeep visual analogy making,\u201d Adv. Neural Inf. Process. Syst., pp.1252-1260, 2015."},{"key":"13","unstructured":"[13] A.J. Summerville, M. Guzdial, M. Mateas, and M.O. Riedl, \u201cLearning player tailored content from observation: Plat-former level generation from video traces using LSTMs,\u201d Artif. Intell. Interact. Digital Entertain. Conf., 2016."},{"key":"14","unstructured":"[14] R. Jain, A. Isaksen, C. Holmgrd, and J. Togelius, \u201cAutoencoders for level generation, repair, and recognition,\u201d Proc. ICCC Workshop Comput. Creativity Games, 2016."},{"key":"15","unstructured":"[15] T. Xue, J. Wu, K. Bouman, and B. Freeman, \u201cVisual dynamics: Probabilistic future frame synthesis via cross convolutional networks,\u201d Adv. Neural Inf. Process. Syst., pp.91-99, 2016."},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] L. Horsley and D. Perez-Liebana, \u201cBuilding an automatic sprite generator with deep convolutional generative adversarial networks,\u201d IEEE Conf. Comput. Intell. Games, pp.134-141, 2017. 10.1109\/cig.2017.8080426","DOI":"10.1109\/CIG.2017.8080426"},{"key":"17","unstructured":"[17] H.H. Kim, \u201cContent generation using variational autoencoder,\u201d Nexon Dev. Conf., 2017."},{"key":"18","unstructured":"[18] C. Beckham and C. Pal, \u201cA step towards procedural terrain generation with GANs,\u201d arXiv preprint arXiv:1707.03383, 2017."},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] E. Giacomello, P.L. Lanzi, and D. Loiacono, \u201cDOOM level generation using generative adversarial networks,\u201d IEEE Games Entertain. Media Conf., pp.316-323, 2018. 10.1109\/gem.2018.8516539","DOI":"10.1109\/GEM.2018.8516539"},{"key":"20","unstructured":"[20] A.K. Hoover, J. Togelius, and G.N. Yannakis, \u201cComposing video game levels with music metaphors through functional scaffolding,\u201d 1st Comput. Creativity Games Workshop, ACC, 2015."},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] A. Khalifa, M.C. Green, D. Perez-Liebana, and J. Togelius, \u201cGeneral video game rule generation,\u201d IEEE Conf. Comput. Intell. Games, pp.170-177. IEEE, 2017. 10.1109\/cig.2017.8080431","DOI":"10.1109\/CIG.2017.8080431"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] M. Sharif, A. Zafar, and U. Muhammad, \u201cDesign patterns and general video game level generation,\u201d Int. J. Adv. Comput. Sci. Appl., vol.8, no.9, pp.393-398, 2017. 10.14569\/ijacsa.2017.080952","DOI":"10.14569\/IJACSA.2017.080952"},{"key":"23","unstructured":"[23] WaveFunctionCollapse: https:\/\/github.com\/mxgmn\/WaveFunctionCollapse, accessed 17 July 2019."},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] H. Scurti and C. Verbrugge, \u201cGenerating paths with WFC,\u201d 14th Artif. Intell. Interact. Digital Entertain. Conf., 2018.","DOI":"10.1609\/aiide.v14i1.13010"},{"key":"25","unstructured":"[25] Bad North Steam: https:\/\/store.steampowered.com\/app\/688420, accessed 17 July 2019."},{"key":"26","unstructured":"[26] City Generator: https:\/\/marian42.itch.io\/wfc, accessed 17 July 2019."},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] R. Bridson, \u201cFast Poisson disk sampling in arbitrary dimensions,\u201d Proc. ACM SIGGRAPH, 2007. 10.1145\/1278780.1278807","DOI":"10.1145\/1278780.1278807"},{"key":"28","unstructured":"[28] Solving Every Sudoku Puzzle by Peter Norvig: http:\/\/norvig.com\/sudoku.html, accessed 17 July 2019."},{"key":"29","unstructured":"[29] Sudoku Solver Using Constraint Programming: https:\/\/gist.github.com\/ksurya\/3940679, accessed 17 July 2019."},{"key":"30","unstructured":"[30] SolvingSudoku: https:\/\/twitter.com\/greentecq\/status\/1037193248756957184, accessed 17 July 2019."},{"key":"31","unstructured":"[31] Three-pathfinding: https:\/\/github.com\/donmccurdy\/three-pathfinding, accessed 17 July 2019."},{"key":"32","unstructured":"[32] Voro, https:\/\/github.com\/jimmyland\/voro, accessed 17 July 2019."},{"key":"33","unstructured":"[33] Voro++, http:\/\/math.lbl.gov\/voro++\/, accessed 17 July 2019."},{"key":"34","unstructured":"[34] J.R. Stuart and P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 2009."},{"key":"35","unstructured":"[35] ECLiPSe, http:\/\/eclipseclp.org\/, accessed 12 March 2020."},{"key":"36","doi-asserted-by":"crossref","unstructured":"[36] S. Dymchenko and M. Mykhailova, \u201cDeclaratively solving tricky Google code jam problems with prolog-based ECLiPSe CLP system,\u201d 30th ACM\/SIGAPP Symposium on Applied Computing, 2015.","DOI":"10.1145\/2695664.2696032"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/8\/E103.D_2019EDP7295\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T10:56:59Z","timestamp":1667645819000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E103.D\/8\/E103.D_2019EDP7295\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,1]]},"references-count":36,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2019edp7295","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,1]]}}}