{"title":"探索无尽的空间","authors":"D. Aldous","doi":"10.1080/07468342.2023.2201150","DOIUrl":null,"url":null,"abstract":"Summary 4X games are a genre of modern computer games, exemplified by the Civilization series, whose initial stages implicitly involve exploring an unknown graph. One exploration scheme is “move to nearest unvisited vertex” and this is in fact forced in the game Endless Space. We revisit the small body of old “worst case” results about the efficiency of this scheme, and comment on the unstudied “average case” problem.","PeriodicalId":38710,"journal":{"name":"College Mathematics Journal","volume":"54 1","pages":"179 - 185"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Exploring Endless Space\",\"authors\":\"D. Aldous\",\"doi\":\"10.1080/07468342.2023.2201150\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary 4X games are a genre of modern computer games, exemplified by the Civilization series, whose initial stages implicitly involve exploring an unknown graph. One exploration scheme is “move to nearest unvisited vertex” and this is in fact forced in the game Endless Space. We revisit the small body of old “worst case” results about the efficiency of this scheme, and comment on the unstudied “average case” problem.\",\"PeriodicalId\":38710,\"journal\":{\"name\":\"College Mathematics Journal\",\"volume\":\"54 1\",\"pages\":\"179 - 185\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"College Mathematics Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/07468342.2023.2201150\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Social Sciences\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"College Mathematics Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/07468342.2023.2201150","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Social Sciences","Score":null,"Total":0}
Summary 4X games are a genre of modern computer games, exemplified by the Civilization series, whose initial stages implicitly involve exploring an unknown graph. One exploration scheme is “move to nearest unvisited vertex” and this is in fact forced in the game Endless Space. We revisit the small body of old “worst case” results about the efficiency of this scheme, and comment on the unstudied “average case” problem.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
