{"id":"https://openalex.org/W2787745455","doi":"https://doi.org/10.3233/icg-1996-19102","title":"The ABDADA Distributed Minimax-Search Algorithm","display_name":"The ABDADA Distributed Minimax-Search Algorithm","publication_year":1996,"publication_date":"1996-03-01","ids":{"openalex":"https://openalex.org/W2787745455","doi":"https://doi.org/10.3233/icg-1996-19102","mag":"2787745455"},"language":"en","primary_location":{"id":"doi:10.3233/icg-1996-19102","is_oa":false,"landing_page_url":"https://doi.org/10.3233/icg-1996-19102","pdf_url":null,"source":{"id":"https://openalex.org/S30686695","display_name":"ICGA Journal","issn_l":"1389-6911","issn":["1389-6911","2468-2438"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310321919","host_organization_name":"International Computer Games Association","host_organization_lineage":["https://openalex.org/P4310321919"],"host_organization_lineage_names":["International Computer Games Association"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICGA Journal","raw_type":"journal-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/A5071176988","display_name":"Jean-Christophe Weill","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jean-Christophe Weill","raw_affiliation_strings":["Paris, France"],"affiliations":[{"raw_affiliation_string":"Paris, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071176988"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5522,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79100585,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"19","issue":"1","first_page":"3","last_page":"16"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9973000288009644,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9973000288009644,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9937000274658203,"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.9911999702453613,"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/implementation","display_name":"Implementation","score":0.7829499244689941},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.7315176725387573},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6774793863296509},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6284399032592773},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.5672374367713928},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5600007772445679},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.49581965804100037},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4633963406085968},{"id":"https://openalex.org/keywords/iterative-deepening-depth-first-search","display_name":"Iterative deepening depth-first search","score":0.4120180904865265},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35088086128234863},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3469385504722595},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2646535336971283},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20448970794677734},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.16852730512619019},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.11732953786849976},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08059811592102051},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07683339715003967},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.038685739040374756}],"concepts":[{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.7829499244689941},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.7315176725387573},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6774793863296509},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6284399032592773},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5672374367713928},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5600007772445679},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.49581965804100037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4633963406085968},{"id":"https://openalex.org/C14362708","wikidata":"https://www.wikidata.org/wiki/Q1675274","display_name":"Iterative deepening depth-first search","level":5,"score":0.4120180904865265},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35088086128234863},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3469385504722595},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2646535336971283},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20448970794677734},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.16852730512619019},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.11732953786849976},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08059811592102051},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07683339715003967},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.038685739040374756},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/icg-1996-19102","is_oa":false,"landing_page_url":"https://doi.org/10.3233/icg-1996-19102","pdf_url":null,"source":{"id":"https://openalex.org/S30686695","display_name":"ICGA Journal","issn_l":"1389-6911","issn":["1389-6911","2468-2438"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310321919","host_organization_name":"International Computer Games Association","host_organization_lineage":["https://openalex.org/P4310321919"],"host_organization_lineage_names":["International Computer Games Association"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICGA Journal","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3098335909","https://openalex.org/W2376570066","https://openalex.org/W2224555876","https://openalex.org/W2166539025","https://openalex.org/W2354057059","https://openalex.org/W3014882394","https://openalex.org/W2208339373","https://openalex.org/W2391773788","https://openalex.org/W2593395660","https://openalex.org/W1973053649"],"abstract_inverted_index":{"This":[0,12],"paper":[1],"presents":[2],"a":[3,31],"new":[4],"method":[5,13],"to":[6,17],"parallelize":[7],"the":[8,18],"mmunax":[9],"tree-search":[10],"algorithm.":[11],"is":[14],"then":[15],"compared":[16],"Young-Brothers-Wait-Concept":[19],"algorithm":[20],"in":[21],"two":[22],"implementations:":[23],"Othello":[24],"and":[25],"Chess.":[26],"Results":[27],"of":[28],"tests":[29],"on":[30],"32-node":[32],"CMS":[33],"are":[34],"given.":[35]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}