{"id":"https://openalex.org/W2767125586","doi":"https://doi.org/10.1109/cig.2017.8080438","title":"Using Monte Carlo tree search and google maps to improve game balancing in location-based games","display_name":"Using Monte Carlo tree search and google maps to improve game balancing in location-based games","publication_year":2017,"publication_date":"2017-08-01","ids":{"openalex":"https://openalex.org/W2767125586","doi":"https://doi.org/10.1109/cig.2017.8080438","mag":"2767125586"},"language":"en","primary_location":{"id":"doi:10.1109/cig.2017.8080438","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2017.8080438","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Conference on Computational Intelligence and Games (CIG)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056604868","display_name":"Lu\u00eds Fernando Maia Santos Silva","orcid":"https://orcid.org/0000-0002-9388-6386"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Luis Fernando Maia","raw_affiliation_strings":["Federal Institute of Education - IFMA, Caxias, MA, Brazil"],"affiliations":[{"raw_affiliation_string":"Federal Institute of Education - IFMA, Caxias, MA, Brazil","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040702221","display_name":"Windson Viana","orcid":"https://orcid.org/0000-0002-8627-0823"},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Windson Viana","raw_affiliation_strings":["GREaT - MDCC Federal University of Cear\u00e1 - UFC, Fortaleza, CE, Brazil"],"affiliations":[{"raw_affiliation_string":"GREaT - MDCC Federal University of Cear\u00e1 - UFC, Fortaleza, CE, Brazil","institution_ids":["https://openalex.org/I243754102"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008630507","display_name":"Fernando Trinta","orcid":"https://orcid.org/0000-0002-0206-1419"},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Fernando Trinta","raw_affiliation_strings":["GREaT - MDCC Federal University of Cear\u00e1 - UFC, Fortaleza, CE, Brazil"],"affiliations":[{"raw_affiliation_string":"GREaT - MDCC Federal University of Cear\u00e1 - UFC, Fortaleza, CE, Brazil","institution_ids":["https://openalex.org/I243754102"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056604868"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2473,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.85593832,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"11","issue":null,"first_page":"215","last_page":"222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10731","display_name":"Educational Games and Gamification","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/3204","display_name":"Developmental and Educational Psychology"},"field":{"id":"https://openalex.org/fields/32","display_name":"Psychology"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11197","display_name":"Digital Games and Media","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.9211894273757935},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7230343818664551},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.6118658781051636},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4893030822277069},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3736528158187866},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15310510993003845},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10828876495361328},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07252222299575806}],"concepts":[{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.9211894273757935},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7230343818664551},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.6118658781051636},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4893030822277069},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3736528158187866},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15310510993003845},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10828876495361328},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07252222299575806}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cig.2017.8080438","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2017.8080438","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Conference on Computational Intelligence and Games (CIG)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323202","display_name":"Funda\u00e7\u00e3o Cearense de Apoio ao Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/007pgtp80"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W609357880","https://openalex.org/W1625390266","https://openalex.org/W1714211023","https://openalex.org/W1970074135","https://openalex.org/W2012988259","https://openalex.org/W2022690496","https://openalex.org/W2032478382","https://openalex.org/W2042439732","https://openalex.org/W2046444663","https://openalex.org/W2048441174","https://openalex.org/W2051967127","https://openalex.org/W2074111410","https://openalex.org/W2113474021","https://openalex.org/W2126316555","https://openalex.org/W2130911438","https://openalex.org/W2137223451","https://openalex.org/W2168304578","https://openalex.org/W2212995356","https://openalex.org/W2252431343","https://openalex.org/W4235615990","https://openalex.org/W6636578284","https://openalex.org/W6637441126","https://openalex.org/W6688129616","https://openalex.org/W7006554213"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2571592646","https://openalex.org/W4247855592","https://openalex.org/W2567165815","https://openalex.org/W2740304877","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4226164546","https://openalex.org/W2766259847","https://openalex.org/W2112583639"],"abstract_inverted_index":{"Location-Based":[0],"games":[1,8,145],"(LBGs)":[2],"are":[3],"a":[4,16,28,92,130,155],"subtype":[5],"of":[6,13,37,63,143],"digital":[7],"that":[9,31,132],"uses":[10,133],"the":[11,24,33,40,64,67,79,158,165],"location":[12,81],"players":[14,110],"as":[15],"key":[17],"component":[18],"for":[19,60],"playability,":[20],"including":[21],"changes":[22],"to":[23,52,72,83,121,139,146],"game":[25,41,58,113,123,150,161],"state.":[26],"However,":[27],"significant":[29],"challenge":[30],"threatens":[32],"development":[34],"and":[35,57,88,103,128,175],"popularization":[36],"LBGs":[38,44,96,127,173],"is":[39,50,70],"balancing.":[42,151],"Since":[43],"rely":[45],"on":[46,78],"players'":[47],"location,":[48],"it":[49],"hard":[51],"manually":[53],"design":[54],"interactions,":[55],"challenges,":[56],"scenarios":[59],"each":[61],"part":[62],"world.":[65],"Thus,":[66],"same":[68],"LBG":[69],"likely":[71],"present":[73,119,154],"varying":[74],"difficulty":[75],"levels":[76],"depending":[77],"player's":[80],"due":[82],"differences":[84,100,148],"in":[85,125,149,160,168],"terrain,":[86],"distance,":[87],"transport":[89],"availability.":[90],"As":[91],"result,":[93],"even":[94],"modern":[95,126],"show":[97],"huge":[98],"balancing":[99,124,162],"between":[101,109],"regions":[102],"they":[104],"do":[105],"not":[106],"explore":[107],"competition":[108],"like":[111],"other":[112],"genres.":[114],"In":[115],"this":[116],"paper,":[117],"we":[118,153],"measurements":[120],"estimate":[122],"introduce":[129],"method":[131,167],"Monte":[134],"Carlo":[135],"Tree":[136],"Search":[137],"(MCTS)":[138],"automatically":[140],"edit":[141],"instances":[142],"these":[144],"minimize":[147],"Additionally,":[152],"study":[156],"detailing":[157],"improvements":[159],"when":[163],"using":[164],"proposed":[166],"today's":[169],"two":[170],"most":[171],"popular":[172],"(Ingress":[174],"Pok\u00e9mon":[176],"Go).":[177]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-17T18:11:37.981687","created_date":"2025-10-10T00:00:00"}