{"id":"https://openalex.org/W1504092304","doi":null,"title":"On Pruning Techniques for Multi-Player Games","display_name":"On Pruning Techniques for Multi-Player Games","alternate_titles":[],"publication_year":2000,"publication_date":"2000-07-30","ids":{"openalex":"https://openalex.org/W1504092304","mag":"1504092304"},"language":"en","primary_location":{"id":"mag:1504092304","doi":null,"is_oa":false,"landing_page_url":"https://www.aaai.org/Papers/AAAI/2000/AAAI00-031.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"National Conference on Artificial Intelligence","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W1504092304"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5041415709","display_name":"Nathan Sturtevant","orcid":"https://orcid.org/0000-0003-4318-2791","observed_orcids":["https://orcid.org/0000-0003-4318-2791"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Nathan Sturtevant","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-4318-2791","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5012387794","display_name":"Richard E. Korf","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Richard E. Korf","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":0.563,"has_fulltext":false,"cited_by_count":91,"citation_normalized_percentile":{"value":0.55288322,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"201","last_page":"207"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9980000257492065,"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.9980000257492065,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.0010999999940395355,"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/T11031","display_name":"Game Theory and Applications","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiplayer-games","display_name":"multiplayer games","score":0.8679999709129333},{"id":"https://openalex.org/keywords/alpha-beta-pruning","display_name":"alpha-beta pruning","score":0.9679999947547913},{"id":"https://openalex.org/keywords/branch-and-bound-pruning","display_name":"branch-and-bound pruning","score":0.9649999737739563},{"id":"https://openalex.org/keywords/game-tree-search","display_name":"game tree search","score":0.5329999923706055},{"id":"https://openalex.org/keywords/sergeant-major","display_name":"sergeant major","score":0.5659999847412109}],"concepts":[{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.8151746988296509},{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.693205714225769},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6733263731002808},{"id":"https://openalex.org/C114290370","wikidata":"https://www.wikidata.org/wiki/Q1415915","display_name":"Null-move heuristic","level":3,"score":0.6186341643333435},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.5877931118011475},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5867571234703064},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5348260402679443},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5258208513259888},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5155253410339355},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5152392983436584},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.49195072054862976},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4660898745059967},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.455778568983078},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.4354703426361084},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3975251615047455},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3813381493091583},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37074118852615356},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.26556396484375},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.11530902981758118},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.08560097217559814},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.08077546954154968},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:1504092304","doi":null,"is_oa":false,"landing_page_url":"https://www.aaai.org/Papers/AAAI/2000/AAAI00-031.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"National Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W194059906","https://openalex.org/W1532584713","https://openalex.org/W2033161995","https://openalex.org/W2157803532","https://openalex.org/W2914923813"],"related_works":["https://openalex.org/W1596672745","https://openalex.org/W7097888067","https://openalex.org/W2120858222","https://openalex.org/W114791049","https://openalex.org/W1599784826","https://openalex.org/W1978012637","https://openalex.org/W2240625969","https://openalex.org/W1558657179","https://openalex.org/W1544638913"],"abstract_inverted_index":{"Max":[0],"n":[1,36,75],"(Luckhardt":[2],"and":[3,92,133],"Irani,":[4],"1986)":[5],"is":[6],"the":[7,10,45,66,104,148,172],"extension":[8],"of":[9,25,81,106,142,154,162,180],"minimax":[11],"backup":[12],"rule":[13],"to":[14,33,49,95,110],"multi-player":[15],"games.":[16],"We":[17,39,77,100],"have":[18],"shown":[19],"that":[20,58],"only":[21],"a":[22,34,62,73,79,89,107,111,118,140,160],"limited":[23],"version":[24],"alpha-beta":[26,70,84,166],"pruning,":[27,29,60,86],"shallow":[28],"can":[30],"be":[31],"applied":[32],"max":[35,74],"search":[37],"tree.":[38,76],"extend":[40],"this":[41,51],"work":[42],"by":[43,139,150],"calculating":[44],"exact":[46],"bounds":[47,170],"needed":[48],"use":[50],"pruning":[52,71,132],"technique.":[53],"In":[54,115],"addition,":[55],"we":[56,122],"show":[57],"branch-and-bound":[59,85,134,146],"using":[61],"monotonic":[63,90],"heuristic,":[64],"has":[65],"same":[67],"limitations":[68],"as":[69],"in":[72,171],"present":[78],"hybrid":[80],"these":[82],"algorithms,":[83],"which":[87],"combines":[88],"heuristic":[91,169],"backed-up":[93],"values":[94],"prune":[96],"even":[97],"more":[98],"effectively.":[99],"also":[101],"briefly":[102],"discuss":[103],"reduction":[105,158,174],"n-player":[108],"game":[109],"\u2018paranoid\u2019":[112],"2-player":[113,157,173],"game.":[114],"Sergeant":[116],"Major,":[117],"3-player":[119],"card":[120],"game,":[121],"averaged":[123],"node":[124,137,176],"expansions":[125,138,149,177],"over":[126],"200":[127],"height":[128],"15":[129],"trees.":[130],"Shallow":[131],"each":[135],"reduced":[136,147,175],"factor":[141,153,161,179],"about":[143],"100.":[144],"Alpha-beta":[145],"an":[151],"additional":[152],"19.":[155],"The":[156],"was":[159],"3":[163],"better":[164],"than":[165],"branchand-bound.":[167],"Using":[168],"another":[178],"12.":[181]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1504092304","counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":8}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
