{"id":"https://openalex.org/W4390481449","doi":"https://doi.org/10.1109/ssci52147.2023.10371917","title":"Optimizing Strategy Games: Ant Colony Optimization vs. Minimax Algorithm","display_name":"Optimizing Strategy Games: Ant Colony Optimization vs. Minimax Algorithm","publication_year":2023,"publication_date":"2023-12-05","ids":{"openalex":"https://openalex.org/W4390481449","doi":"https://doi.org/10.1109/ssci52147.2023.10371917"},"language":"en","primary_location":{"id":"doi:10.1109/ssci52147.2023.10371917","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci52147.2023.10371917","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE Symposium Series on Computational Intelligence (SSCI)","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/A5081489289","display_name":"Yoqsan Angeles-Garc\u00eda","orcid":"https://orcid.org/0009-0004-0886-5540"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yoqsan Angeles-Garc\u00eda","raw_affiliation_strings":["Instituto Polité cnico Nacional,Computational Cognitive Sciences Laboratory-CIC,Mexico City,Mexico"],"raw_orcid":"https://orcid.org/0009-0004-0886-5540","affiliations":[{"raw_affiliation_string":"Instituto Polité cnico Nacional,Computational Cognitive Sciences Laboratory-CIC,Mexico City,Mexico","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059131073","display_name":"Valeria Karina Legaria-Santiago","orcid":"https://orcid.org/0009-0008-4843-4971"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Valeria Karina Legaria-Santiago","raw_affiliation_strings":["Instituto Polité cnico Nacional,Centro de Investigació n en Computación (CIC),Mexico City,Mexico"],"raw_orcid":"https://orcid.org/0009-0008-4843-4971","affiliations":[{"raw_affiliation_string":"Instituto Polité cnico Nacional,Centro de Investigació n en Computación (CIC),Mexico City,Mexico","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013900841","display_name":"\u00c1lvaro Anzueto-R\u00edos","orcid":"https://orcid.org/0000-0003-1627-0323"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\u00c1lvaro Azueto-R\u00edos","raw_affiliation_strings":["Instituto Politécnico Nacional,U. Prof Interdisciplinaria en Ingenierí a y Tecnologias Avanzadas UPIITA,Mexico City,Mexico"],"raw_orcid":"https://orcid.org/0000-0003-1627-0323","affiliations":[{"raw_affiliation_string":"Instituto Politécnico Nacional,U. Prof Interdisciplinaria en Ingenierí a y Tecnologias Avanzadas UPIITA,Mexico City,Mexico","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055414768","display_name":"Hiram Calvo","orcid":"https://orcid.org/0000-0003-2836-2102"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hiram Calvo","raw_affiliation_strings":["Instituto Polité cnico Nacional,Computational Cognitive Sciences Laboratory-CIC,Mexico City,Mexico"],"raw_orcid":"https://orcid.org/0000-0003-2836-2102","affiliations":[{"raw_affiliation_string":"Instituto Polité cnico Nacional,Computational Cognitive Sciences Laboratory-CIC,Mexico City,Mexico","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18371216,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1449","last_page":"1454"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9998999834060669,"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.9998999834060669,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9977999925613403,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9934999942779541,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.89274001121521},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7807611227035522},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6781065464019775},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6778198480606079},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5670880675315857},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5108335018157959},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4599953889846802},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20413947105407715}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.89274001121521},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7807611227035522},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6781065464019775},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6778198480606079},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5670880675315857},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5108335018157959},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4599953889846802},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20413947105407715},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci52147.2023.10371917","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci52147.2023.10371917","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W2064147144","https://openalex.org/W2108375780","https://openalex.org/W2161551226","https://openalex.org/W2322232506","https://openalex.org/W2902907165","https://openalex.org/W2920956495","https://openalex.org/W2953382260","https://openalex.org/W2972518100","https://openalex.org/W2972758523","https://openalex.org/W2978304571","https://openalex.org/W3155123481","https://openalex.org/W4206191234"],"related_works":["https://openalex.org/W1667647204","https://openalex.org/W2404647514","https://openalex.org/W4247536566","https://openalex.org/W2018477250","https://openalex.org/W3119814709","https://openalex.org/W4241418540","https://openalex.org/W1508895727","https://openalex.org/W2725786787","https://openalex.org/W3182145356","https://openalex.org/W4285338599"],"abstract_inverted_index":{"This":[0],"article":[1],"proposes":[2],"an":[3,9,127],"Ant":[4],"Colony":[5],"Optimization":[6],"(ACO)":[7],"algorithm,":[8,55],"optimization":[10,123],"method":[11],"to":[12,18,97,130],"find":[13],"paths":[14],"in":[15,35,56,67,106,140],"graphs,":[16],"adapted":[17],"solve":[19],"strategic":[20],"games.":[21,114],"The":[22,44,63],"games":[23],"of":[24,59,69,74,104,112,134],"study":[25],"are":[26],"Tic-Tac-Toe":[27,60],"(also":[28],"known":[29],"as":[30],"noughts":[31],"and":[32,40,42,61,78],"crosses,":[33],"three":[34],"a":[36,87],"row,":[37],"or":[38],"Xs":[39],"Os),":[41],"Chess.":[43,62],"algorithms'":[45],"performance":[46,64,91],"is":[47,65],"contrasted":[48],"by":[49,92,137],"contending":[50],"ACO":[51,94,105],"against":[52],"the":[53,75,83,93,102,116,120,132],"Minimax":[54],"different":[57],"setups":[58],"explained":[66],"terms":[68],"average":[70,90],"time":[71],"response,":[72],"correctness":[73],"move":[76],"choice,":[77],"memory":[79],"used":[80],"when":[81],"executing":[82],"function.":[84],"Results":[85],"reveal":[86],"slightly":[88],"better":[89],"algorithm":[95],"compared":[96],"Minimax.":[98],"These":[99],"findings":[100],"highlight":[101],"ability":[103],"decision-making":[107],"algorithms":[108],"without":[109],"requiring":[110],"knowledge":[111],"previous":[113],"Furthermore,":[115],"results":[117],"suggest":[118],"that":[119,142],"ACO-based":[121],"path":[122],"approach":[124],"can":[125],"be":[126],"effective":[128],"alternative":[129],"improve":[131],"efficiency":[133],"decisions":[135],"made":[136],"intelligent":[138],"systems":[139],"environments":[141],"require":[143],"rapid":[144],"response.":[145]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}