{"id":"https://openalex.org/W6964533042","doi":"https://doi.org/10.26190/unsworks/21886","title":"Solving General Game Playing with Incomplete Information Problem using Iterative Tree Search and Language Learning","display_name":"Solving General Game Playing with Incomplete Information Problem using Iterative Tree Search and Language Learning","publication_year":2022,"publication_date":"2022-03-23","ids":{"openalex":"https://openalex.org/W6964533042","doi":"https://doi.org/10.26190/unsworks/21886"},"language":"en","primary_location":{"id":"pmh:oai:unsworks.library.unsw.edu.au:1959.4/67169","is_oa":true,"landing_page_url":"http://hdl.handle.net/1959.4/67169","pdf_url":null,"source":{"id":"https://openalex.org/S4306401737","display_name":"UNSWorks (University of New South Wales, Sydney, Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40053085","host_organization_name":"Australian Defence Force Academy","host_organization_lineage":["https://openalex.org/I40053085"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"http://purl.org/coar/resource_type/c_db06"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1959.4/67169","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Chitizadeh, Armin","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chitizadeh, Armin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10453","display_name":"Maternal and Perinatal Health Interventions","score":0.3449999988079071,"subfield":{"id":"https://openalex.org/subfields/2729","display_name":"Obstetrics and Gynecology"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},"topics":[{"id":"https://openalex.org/T10453","display_name":"Maternal and Perinatal Health Interventions","score":0.3449999988079071,"subfield":{"id":"https://openalex.org/subfields/2729","display_name":"Obstetrics and Gynecology"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T10209","display_name":"Global Maternal and Child Health","score":0.07930000126361847,"subfield":{"id":"https://openalex.org/subfields/2735","display_name":"Pediatrics, Perinatology and Child Health"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T12741","display_name":"Maternal and Neonatal Healthcare","score":0.07909999787807465,"subfield":{"id":"https://openalex.org/subfields/3600","display_name":"General Health Professions"},"field":{"id":"https://openalex.org/fields/36","display_name":"Health Professions"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.794700026512146},{"id":"https://openalex.org/keywords/complete-information","display_name":"Complete information","score":0.569100022315979},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5382000207901001},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5138999819755554},{"id":"https://openalex.org/keywords/game-tree","display_name":"Game tree","score":0.4068000018596649},{"id":"https://openalex.org/keywords/outcome","display_name":"Outcome (game theory)","score":0.40389999747276306},{"id":"https://openalex.org/keywords/extensive-form-game","display_name":"Extensive-form game","score":0.3961000144481659},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.39070001244544983}],"concepts":[{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.794700026512146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7700999975204468},{"id":"https://openalex.org/C113336015","wikidata":"https://www.wikidata.org/wiki/Q574010","display_name":"Complete information","level":2,"score":0.569100022315979},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5382000207901001},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5138999819755554},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4934999942779541},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.47099998593330383},{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.4068000018596649},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.40389999747276306},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4018000066280365},{"id":"https://openalex.org/C146930158","wikidata":"https://www.wikidata.org/wiki/Q656416","display_name":"Extensive-form game","level":4,"score":0.3961000144481659},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.39070001244544983},{"id":"https://openalex.org/C102234262","wikidata":"https://www.wikidata.org/wiki/Q1320931","display_name":"Combinatorial game theory","level":4,"score":0.3668000102043152},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.36169999837875366},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.3343000113964081},{"id":"https://openalex.org/C137293760","wikidata":"https://www.wikidata.org/wiki/Q3621696","display_name":"Language model","level":2,"score":0.3124000132083893},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.3122999966144562},{"id":"https://openalex.org/C195324797","wikidata":"https://www.wikidata.org/wiki/Q33742","display_name":"Natural language","level":2,"score":0.2946000099182129},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.28619998693466187},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.26660001277923584},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.26330000162124634},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25220000743865967}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:unsworks.library.unsw.edu.au:1959.4/67169","is_oa":true,"landing_page_url":"http://hdl.handle.net/1959.4/67169","pdf_url":null,"source":{"id":"https://openalex.org/S4306401737","display_name":"UNSWorks (University of New South Wales, Sydney, Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40053085","host_organization_name":"Australian Defence Force Academy","host_organization_lineage":["https://openalex.org/I40053085"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"http://purl.org/coar/resource_type/c_db06"},{"id":"doi:10.26190/unsworks/21886","is_oa":true,"landing_page_url":"https://doi.org/10.26190/unsworks/21886","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Dissertation"}],"best_oa_location":{"id":"pmh:oai:unsworks.library.unsw.edu.au:1959.4/67169","is_oa":true,"landing_page_url":"http://hdl.handle.net/1959.4/67169","pdf_url":null,"source":{"id":"https://openalex.org/S4306401737","display_name":"UNSWorks (University of New South Wales, Sydney, Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40053085","host_organization_name":"Australian Defence Force Academy","host_organization_lineage":["https://openalex.org/I40053085"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"http://purl.org/coar/resource_type/c_db06"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"General":[0,222,287],"Game":[1],"Playing":[2],"with":[3,44,116,332,337],"Incomplete":[4],"Information":[5],"(GGP-II)":[6],"is":[7,42,226,276],"about":[8],"developing":[9],"a":[10,177,216,245,268,333],"system":[11],"capable":[12,227],"of":[13,48,95,181,189,228,259,274],"successfully":[14,344],"playing":[15],"incomplete":[16],"information":[17,127],"games":[18,37,60,144,149,194,208],"without":[19],"human":[20],"intervention":[21],"by":[22,112,131,329,349],"just":[23],"receiving":[24],"their":[25,239,312],"rules":[26],"at":[27],"runtime.":[28],"Different":[29],"algorithms":[30,49,84],"(players)":[31],"have":[32],"been":[33],"provided":[34],"to":[35,85,141,172,200,205,237,279,299,302,311,314],"play":[36,142,207],"in":[38,50,59,135],"GGP-II.":[39],"This":[40,164,264,293],"research":[41],"concerned":[43],"three":[45],"main":[46,272],"limitations":[47,94],"the":[51,91,101,109,147,157,174,182,187,196,286,296,307,315,346,351],"literature:":[52],"valuing-information,":[53],"generating":[54,132,229],"mixed":[55,133,202],"strategy":[56,111],"and":[57,70,81,89,93,121,128,145,204],"cooperating":[58],"which":[61,150,209],"require":[62,151,210],"implicit":[63,152,211,231,352],"communication.":[64,153,212],"In":[65],"this":[66,190],"thesis,":[67],"I":[68,99,118,155,184,214,284,323],"theoretically":[69,120],"experimentally":[71,122,185],"show":[72,119,186],"why":[73],"past":[74],"GGP-II":[75,262],"players":[76,236],"suffer":[77],"from":[78,195],"these":[79,87],"problems":[80,88],"introduce":[82,100,215],"four":[83],"overcome":[86],"discuss":[90],"advantages":[92],"each":[96],"algorithm.":[97,106,270],"Firstly,":[98],"Iterative":[102,160],"Tree":[103,161,169,289],"Search":[104,162,170,290],"(ITS)":[105],"ITS":[107,124,139],"learns":[108],"best":[110],"simulating":[113],"different":[114,136,193],"plays":[115],"itself.":[117],"how":[123],"correctly":[125,206],"values":[126],"models":[129],"opponents":[130],"strategies":[134,203,348],"games.":[137,304],"However,":[138],"fails":[140,199],"large":[143,281,303],"also":[146],"cooperative":[148,235],"Secondly,":[154],"present":[156,285],"Monte":[158,167],"Carlo":[159,168],"(MCITS).":[163],"algorithm":[165,191,291,294,343],"uses":[166],"technique":[171,220,243,298],"focus":[173],"search":[175],"on":[176,192,257],"more":[178],"promising":[179],"part":[180],"game.":[183],"success":[188],"literature.":[197],"MCITS":[198],"generate":[201],"Thirdly,":[213],"communication":[217,232,246,308,353],"language":[218,233,247],"learning":[219],"called":[221],"Language":[223,288],"(GL).":[224],"GL":[225,242,275,297],"an":[230,249,325],"for":[234],"share":[238],"information.":[240],"The":[241,271,341],"sees":[244],"as":[248],"additional":[250],"game":[251],"rule.":[252],"It":[253,305],"can":[254],"be":[255,300],"used":[256],"top":[258],"any":[260],"existing":[261],"player.":[263],"feature":[265],"makes":[266],"it":[267,331],"general":[269],"limitation":[273],"its":[277],"inability":[278],"solve":[280],"problems.":[282],"Finally,":[283],"(GLTS).":[292],"extends":[295],"applicable":[301],"prioritises":[306],"languages":[309],"according":[310],"closeness":[313],"most":[316],"successful":[317],"one.":[318],"To":[319],"validate":[320],"my":[321],"claim,":[322],"perform":[324],"experiment":[326],"using":[327],"GLTS":[328,342],"providing":[330],"Multi-Agent":[334],"Path":[335],"Finding":[336],"Destination":[338],"Uncertainty":[339],"problem.":[340],"discovers":[345],"desired":[347],"utilising":[350],"among":[354],"agents.":[355]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}
