Abhishek Parakh, M. Subramaniam, P. Chundi, E. Ostler
{"title":"严肃游戏中嵌入和遍历问题的新方法","authors":"Abhishek Parakh, M. Subramaniam, P. Chundi, E. Ostler","doi":"10.1145/3368308.3415417","DOIUrl":null,"url":null,"abstract":"This paper presents a novel approach for embedding and traversing problems in serious games. Given a set of concepts, problems built upon these concepts, and the complexities of the concepts, we propose an automatic mechanism that aids the game developers on which problems can be put on the same level and which problems must only be reachable when certain dependencies are met. The proposed network traversal algorithm allows the player/student to efficiently complete all the problems with increasing complexity at each step. The proposed approach is general purpose and has has been implemented in our quantum cryptography game, QuaSim.","PeriodicalId":374890,"journal":{"name":"Proceedings of the 21st Annual Conference on Information Technology Education","volume":"112 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A Novel Approach for Embedding and Traversing Problems in Serious Games\",\"authors\":\"Abhishek Parakh, M. Subramaniam, P. Chundi, E. Ostler\",\"doi\":\"10.1145/3368308.3415417\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a novel approach for embedding and traversing problems in serious games. Given a set of concepts, problems built upon these concepts, and the complexities of the concepts, we propose an automatic mechanism that aids the game developers on which problems can be put on the same level and which problems must only be reachable when certain dependencies are met. The proposed network traversal algorithm allows the player/student to efficiently complete all the problems with increasing complexity at each step. The proposed approach is general purpose and has has been implemented in our quantum cryptography game, QuaSim.\",\"PeriodicalId\":374890,\"journal\":{\"name\":\"Proceedings of the 21st Annual Conference on Information Technology Education\",\"volume\":\"112 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 21st Annual Conference on Information Technology Education\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3368308.3415417\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 21st Annual Conference on Information Technology Education","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3368308.3415417","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Novel Approach for Embedding and Traversing Problems in Serious Games
This paper presents a novel approach for embedding and traversing problems in serious games. Given a set of concepts, problems built upon these concepts, and the complexities of the concepts, we propose an automatic mechanism that aids the game developers on which problems can be put on the same level and which problems must only be reachable when certain dependencies are met. The proposed network traversal algorithm allows the player/student to efficiently complete all the problems with increasing complexity at each step. The proposed approach is general purpose and has has been implemented in our quantum cryptography game, QuaSim.