| Jump to content | https://en.wikipedia.org/wiki/Alpha–beta_pruning#bodyContent |
| Main page | https://en.wikipedia.org/wiki/Main_Page |
| Contents | https://en.wikipedia.org/wiki/Wikipedia:Contents |
| Current events | https://en.wikipedia.org/wiki/Portal:Current_events |
| Random article | https://en.wikipedia.org/wiki/Special:Random |
| About Wikipedia | https://en.wikipedia.org/wiki/Wikipedia:About |
| Contact us | https://en.wikipedia.org/wiki/Wikipedia:Contact_us |
| Help | https://en.wikipedia.org/wiki/Help:Contents |
| Learn to edit | https://en.wikipedia.org/wiki/Help:Introduction |
| Community portal | https://en.wikipedia.org/wiki/Wikipedia:Community_portal |
| Recent changes | https://en.wikipedia.org/wiki/Special:RecentChanges |
| Upload file | https://en.wikipedia.org/wiki/Wikipedia:File_upload_wizard |
| Special pages | https://en.wikipedia.org/wiki/Special:SpecialPages |
|
| https://en.wikipedia.org/wiki/Main_Page |
|
Search
| https://en.wikipedia.org/wiki/Special:Search |
| Donate | https://donate.wikimedia.org/?wmf_source=donate&wmf_medium=sidebar&wmf_campaign=en.wikipedia.org&uselang=en |
| Create account | https://en.wikipedia.org/w/index.php?title=Special:CreateAccount&returnto=Alpha%E2%80%93beta+pruning |
| Log in | https://en.wikipedia.org/w/index.php?title=Special:UserLogin&returnto=Alpha%E2%80%93beta+pruning |
| Donate | https://donate.wikimedia.org/?wmf_source=donate&wmf_medium=sidebar&wmf_campaign=en.wikipedia.org&uselang=en |
| Create account | https://en.wikipedia.org/w/index.php?title=Special:CreateAccount&returnto=Alpha%E2%80%93beta+pruning |
| Log in | https://en.wikipedia.org/w/index.php?title=Special:UserLogin&returnto=Alpha%E2%80%93beta+pruning |
|
(Top)
| https://en.wikipedia.org/wiki/Alpha–beta_pruning |
|
1
History
| https://en.wikipedia.org/wiki/Alpha–beta_pruning#History |
|
2
Core idea
| https://en.wikipedia.org/wiki/Alpha–beta_pruning#Core_idea |
|
3
Improvements over naive minimax
| https://en.wikipedia.org/wiki/Alpha–beta_pruning#Improvements_over_naive_minimax |
|
4
Pseudocode
| https://en.wikipedia.org/wiki/Alpha–beta_pruning#Pseudocode |
|
5
Heuristic improvements
| https://en.wikipedia.org/wiki/Alpha–beta_pruning#Heuristic_improvements |
|
6
Other algorithms
| https://en.wikipedia.org/wiki/Alpha–beta_pruning#Other_algorithms |
|
7
See also
| https://en.wikipedia.org/wiki/Alpha–beta_pruning#See_also |
|
8
References
| https://en.wikipedia.org/wiki/Alpha–beta_pruning#References |
|
9
Bibliography
| https://en.wikipedia.org/wiki/Alpha–beta_pruning#Bibliography |
| العربية | https://ar.wikipedia.org/wiki/%D8%AA%D9%82%D9%8A%D9%8A%D9%85_%D8%A3%D9%84%D9%81%D8%A7_%D8%A8%D9%8A%D8%AA%D8%A7 |
| Čeština | https://cs.wikipedia.org/wiki/Alfa-beta_o%C5%99ez%C3%A1v%C3%A1n%C3%AD |
| Deutsch | https://de.wikipedia.org/wiki/Alpha-Beta-Suche |
| Español | https://es.wikipedia.org/wiki/Poda_alfa-beta |
| فارسی | https://fa.wikipedia.org/wiki/%D9%87%D8%B1%D8%B3_%D8%A2%D9%84%D9%81%D8%A7_%D8%A8%D8%AA%D8%A7 |
| Français | https://fr.wikipedia.org/wiki/%C3%89lagage_alpha-b%C3%AAta |
| עברית | https://he.wikipedia.org/wiki/%D7%92%D7%99%D7%96%D7%95%D7%9D_%D7%90%D7%9C%D7%A4%D7%90-%D7%91%D7%99%D7%AA%D7%90 |
| Magyar | https://hu.wikipedia.org/wiki/Alfa-b%C3%A9ta_v%C3%A1g%C3%A1s |
| Italiano | https://it.wikipedia.org/wiki/Potatura_alfa-beta |
| 日本語 | https://ja.wikipedia.org/wiki/%E3%82%A2%E3%83%AB%E3%83%95%E3%82%A1%E3%83%BB%E3%83%99%E3%83%BC%E3%82%BF%E6%B3%95 |
| 한국어 | https://ko.wikipedia.org/wiki/%EC%95%8C%ED%8C%8C-%EB%B2%A0%ED%83%80_%EA%B0%80%EC%A7%80%EC%B9%98%EA%B8%B0 |
| Polski | https://pl.wikipedia.org/wiki/Algorytm_alfa-beta |
| Русский | https://ru.wikipedia.org/wiki/%D0%90%D0%BB%D1%8C%D1%84%D0%B0-%D0%B1%D0%B5%D1%82%D0%B0-%D0%BE%D1%82%D1%81%D0%B5%D1%87%D0%B5%D0%BD%D0%B8%D0%B5 |
| Simple English | https://simple.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning |
| Српски / srpski | https://sr.wikipedia.org/wiki/Alfa-beta_pretraga |
| Tagalog | https://tl.wikipedia.org/wiki/Pagtatabas_na_alpha-beta |
| Українська | https://uk.wikipedia.org/wiki/%D0%92%D1%96%D0%B4%D1%81%D1%96%D1%87%D0%B5%D0%BD%D0%BD%D1%8F_%D0%B0%D0%BB%D1%8C%D1%84%D0%B0-%D0%B1%D0%B5%D1%82%D0%B0 |
| 粵語 | https://zh-yue.wikipedia.org/wiki/Alpha-beta_%E5%89%AA%E6%9E%9D |
| 中文 | https://zh.wikipedia.org/wiki/Alpha-beta%E5%89%AA%E6%9E%9D |
| Edit links | https://www.wikidata.org/wiki/Special:EntityPage/Q570496#sitelinks-wikipedia |
| Article | https://en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning |
| Talk | https://en.wikipedia.org/wiki/Talk:Alpha%E2%80%93beta_pruning |
| Read | https://en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning |
| Edit | https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&action=edit |
| View history | https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&action=history |
| Read | https://en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning |
| Edit | https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&action=edit |
| View history | https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&action=history |
| What links here | https://en.wikipedia.org/wiki/Special:WhatLinksHere/Alpha%E2%80%93beta_pruning |
| Related changes | https://en.wikipedia.org/wiki/Special:RecentChangesLinked/Alpha%E2%80%93beta_pruning |
| Upload file | https://en.wikipedia.org/wiki/Wikipedia:File_Upload_Wizard |
| Permanent link | https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&oldid=1332549876 |
| Page information | https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&action=info |
| Cite this page | https://en.wikipedia.org/w/index.php?title=Special:CiteThisPage&page=Alpha%E2%80%93beta_pruning&id=1332549876&wpFormIdentifier=titleform |
| Get shortened URL | https://en.wikipedia.org/w/index.php?title=Special:UrlShortener&url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FAlpha%25E2%2580%2593beta_pruning |
| Download QR code | https://en.wikipedia.org/w/index.php?title=Special:QrCode&url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FAlpha%25E2%2580%2593beta_pruning |
| Download as PDF | https://en.wikipedia.org/w/index.php?title=Special:DownloadAsPdf&page=Alpha%E2%80%93beta_pruning&action=show-download-screen |
| Printable version | https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&printable=yes |
| Wikidata item | https://www.wikidata.org/wiki/Special:EntityPage/Q570496 |
| Alphabeta (disambiguation) | https://en.wikipedia.org/wiki/Alphabeta_(disambiguation) |
| Search algorithm | https://en.wikipedia.org/wiki/Search_algorithm |
| Worst-case | https://en.wikipedia.org/wiki/Best,_worst_and_average_case |
| performance | https://en.wikipedia.org/wiki/Time_complexity |
| Best-case | https://en.wikipedia.org/wiki/Best,_worst_and_average_case |
| performance | https://en.wikipedia.org/wiki/Time_complexity |
| search algorithm | https://en.wikipedia.org/wiki/Search_algorithm |
| minimax algorithm | https://en.wikipedia.org/wiki/Minimax#Minimax_algorithm_with_alternate_moves |
| search tree | https://en.wikipedia.org/wiki/Game_tree |
| combinatorial games | https://en.wikipedia.org/wiki/Combinatorial_game_theory |
| Tic-tac-toe | https://en.wikipedia.org/wiki/Tic-tac-toe |
| Chess | https://en.wikipedia.org/wiki/Chess |
| Connect 4 | https://en.wikipedia.org/wiki/Connect_4 |
| [1] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-FOOTNOTERussellNorvig2021152-161-1 |
| edit | https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&action=edit§ion=1 |
| Dartmouth Workshop | https://en.wikipedia.org/wiki/Dartmouth_workshop |
| IBM | https://en.wikipedia.org/wiki/IBM |
| [2] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-2 |
| Allen Newell | https://en.wikipedia.org/wiki/Allen_Newell |
| Herbert A. Simon | https://en.wikipedia.org/wiki/Herbert_A._Simon |
| John McCarthy | https://en.wikipedia.org/wiki/John_McCarthy_(computer_scientist) |
| [3] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-JMC-3 |
| [4] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-NS-4 |
| Arthur Samuel | https://en.wikipedia.org/wiki/Arthur_Samuel_(computer_scientist) |
| United States | https://en.wikipedia.org/wiki/United_States |
| [5] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-AIM30-5 |
| Dartmouth workshop | https://en.wikipedia.org/wiki/Dartmouth_workshop |
| Alan Kotok | https://en.wikipedia.org/wiki/Alan_Kotok |
| [6] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-AIM41-6 |
| Alexander Brudno | https://en.wikipedia.org/wiki/Alexander_Brudno |
| [7] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-Marsland-7 |
| Donald Knuth | https://en.wikipedia.org/wiki/Donald_Knuth |
| [8] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-Knuth-Moore-8 |
| [9] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-Abramson-9 |
| Judea Pearl | https://en.wikipedia.org/wiki/Judea_Pearl |
| [10] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-Pearl1980-10 |
| [11] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-Pearl1982-11 |
| [12] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-SaksWigderson-12 |
| edit | https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&action=edit§ion=2 |
| game tree | https://en.wikipedia.org/wiki/Game_tree |
| zero-sum games | https://en.wikipedia.org/wiki/Zero-sum_game |
| [13] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-levy198601-13 |
| edit | https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&action=edit§ion=3 |
| https://en.wikipedia.org/wiki/File:AB_pruning.svg |
| [13] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-levy198601-13 |
| branch and bound | https://en.wikipedia.org/wiki/Branch_and_bound |
| branching factor | https://en.wikipedia.org/wiki/Branching_factor |
| plies | https://en.wikipedia.org/wiki/Ply_(game_theory) |
| pessimal | https://en.wiktionary.org/wiki/pessimal |
| O | https://en.wikipedia.org/wiki/Big_O_notation |
| square root | https://en.wikipedia.org/wiki/Square_root |
| [14] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-FOOTNOTERussellNorvig2021155-14 |
| [12] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-SaksWigderson-12 |
| [10] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-Pearl1980-10 |
| [11] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-Pearl1982-11 |
| [11] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-Pearl1982-11 |
| [10] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-Pearl1980-10 |
| [13] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-levy198601-13 |
| https://en.wikipedia.org/wiki/File:Minmaxab.gif |
| negamax | https://en.wikipedia.org/wiki/Negamax |
| subtrees | https://en.wikipedia.org/wiki/Subtrees |
| iterative deepening | https://en.wikipedia.org/wiki/Iterative_deepening_depth-first_search |
| principal variation | https://en.wikipedia.org/wiki/Principal_variation |
| MTD(f) | https://en.wikipedia.org/wiki/MTD(f) |
| edit | https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&action=edit§ion=4 |
| [15] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-FOOTNOTERussellNorvig2021154-15 |
| ∞ | https://en.wikipedia.org/wiki/Infinity |
| ∞ | https://en.wikipedia.org/wiki/Infinity |
| edit | https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&action=edit§ion=5 |
| heuristics | https://en.wikipedia.org/wiki/Heuristic |
| earlier passes | https://en.wikipedia.org/wiki/Iterative_deepening_depth-first_search |
| killer heuristic | https://en.wikipedia.org/wiki/Killer_heuristic |
| refutation tables | https://en.wikipedia.org/wiki/Refutation_table |
| aspiration window | https://en.wikipedia.org/wiki/Aspiration_window |
| zero-window search | https://en.wikipedia.org/wiki/MTD(f)#Zero-window_searches |
| edit | https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&action=edit§ion=6 |
| minimax | https://en.wikipedia.org/wiki/Minimax |
| depth-first | https://en.wikipedia.org/wiki/Depth-first_search |
| iterative deepening | https://en.wikipedia.org/wiki/Iterative_deepening_depth-first_search |
| SSS* | https://en.wikipedia.org/wiki/SSS* |
| best-first | https://en.wikipedia.org/wiki/Best_first_search |
| [16] | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_note-16 |
| edit | https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&action=edit§ion=7 |
| Minimax | https://en.wikipedia.org/wiki/Minimax |
| Expectiminimax | https://en.wikipedia.org/wiki/Expectiminimax |
| Negamax | https://en.wikipedia.org/wiki/Negamax |
| Pruning (algorithm) | https://en.wikipedia.org/wiki/Pruning_(algorithm) |
| Branch and bound | https://en.wikipedia.org/wiki/Branch_and_bound |
| Combinatorial optimization | https://en.wikipedia.org/wiki/Combinatorial_optimization |
| Principal variation search | https://en.wikipedia.org/wiki/Principal_variation_search |
| Transposition table | https://en.wikipedia.org/wiki/Transposition_table |
| Late move reductions | https://en.wikipedia.org/wiki/Late_move_reductions |
| edit | https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&action=edit§ion=8 |
| ^ | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-FOOTNOTERussellNorvig2021152-161_1-0 |
| Russell & Norvig 2021 | https://en.wikipedia.org/wiki/Alpha–beta_pruning#CITEREFRussellNorvig2021 |
| ^ | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-2 |
| "The Dartmouth Workshop--as planned and as it happened" | https://www-formal.stanford.edu/jmc/slides/dartmouth/dartmouth/node1.html |
| ^ | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-JMC_3-0 |
| "Human Level AI Is Harder Than It Seemed in 1955" | http://www-formal.stanford.edu/jmc/slides/wrong/wrong-sli/wrong-sli.html |
| ^ | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-NS_4-0 |
| "Computer science as empirical inquiry: symbols and search" | https://doi.org/10.1145%2F360018.360022 |
| doi | https://en.wikipedia.org/wiki/Doi_(identifier) |
| 10.1145/360018.360022 | https://doi.org/10.1145%2F360018.360022 |
| ^ | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-AIM30_5-0 |
| Massachusetts Institute of Technology | https://en.wikipedia.org/wiki/Massachusetts_Institute_of_Technology |
| hdl | https://en.wikipedia.org/wiki/Hdl_(identifier) |
| 1721.1/6098 | https://hdl.handle.net/1721.1%2F6098 |
| ^ | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-AIM41_6-0 |
| "A Chess Playing Program" | http://www.kotok.org/AI_Memo_41.html |
| ^ | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-Marsland_7-0 |
| "Computer Chess Methods" | https://web.archive.org/web/20081030023047/http://www.cs.ualberta.ca/~tony/OldPapers/encyc.mac.pdf |
| ISBN | https://en.wikipedia.org/wiki/ISBN_(identifier) |
| 978-0-471-62974-0 | https://en.wikipedia.org/wiki/Special:BookSources/978-0-471-62974-0 |
| the original | http://www.cs.ualberta.ca/~tony/OldPapers/encyc.mac.pdf |
| ^ | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-Knuth-Moore_8-0 |
| doi | https://en.wikipedia.org/wiki/Doi_(identifier) |
| 10.1016/0004-3702(75)90019-3 | https://doi.org/10.1016%2F0004-3702%2875%2990019-3 |
| S2CID | https://en.wikipedia.org/wiki/S2CID_(identifier) |
| 7894372 | https://api.semanticscholar.org/CorpusID:7894372 |
| ^ | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-Abramson_9-0 |
| doi | https://en.wikipedia.org/wiki/Doi_(identifier) |
| 10.1145/66443.66444 | https://doi.org/10.1145%2F66443.66444 |
| S2CID | https://en.wikipedia.org/wiki/S2CID_(identifier) |
| 11526154 | https://api.semanticscholar.org/CorpusID:11526154 |
| a | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-Pearl1980_10-0 |
| b | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-Pearl1980_10-1 |
| c | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-Pearl1980_10-2 |
| Artificial Intelligence | https://en.wikipedia.org/wiki/Artificial_Intelligence_(journal) |
| doi | https://en.wikipedia.org/wiki/Doi_(identifier) |
| 10.1016/0004-3702(80)90037-5 | https://doi.org/10.1016%2F0004-3702%2880%2990037-5 |
| a | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-Pearl1982_11-0 |
| b | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-Pearl1982_11-1 |
| c | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-Pearl1982_11-2 |
| "The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm and Its Optimality" | https://doi.org/10.1145%2F358589.358616 |
| doi | https://en.wikipedia.org/wiki/Doi_(identifier) |
| 10.1145/358589.358616 | https://doi.org/10.1145%2F358589.358616 |
| S2CID | https://en.wikipedia.org/wiki/S2CID_(identifier) |
| 8296219 | https://api.semanticscholar.org/CorpusID:8296219 |
| a | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-SaksWigderson_12-0 |
| b | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-SaksWigderson_12-1 |
| doi | https://en.wikipedia.org/wiki/Doi_(identifier) |
| 10.1109/SFCS.1986.44 | https://doi.org/10.1109%2FSFCS.1986.44 |
| ISBN | https://en.wikipedia.org/wiki/ISBN_(identifier) |
| 0-8186-0740-8 | https://en.wikipedia.org/wiki/Special:BookSources/0-8186-0740-8 |
| S2CID | https://en.wikipedia.org/wiki/S2CID_(identifier) |
| 6130392 | https://api.semanticscholar.org/CorpusID:6130392 |
| a | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-levy198601_13-0 |
| b | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-levy198601_13-1 |
| c | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-levy198601_13-2 |
| "Alpha-Beta Soup" | https://archive.org/details/MacUser8601January1986/page/n101/mode/2up |
| ^ | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-FOOTNOTERussellNorvig2021155_14-0 |
| Russell & Norvig 2021 | https://en.wikipedia.org/wiki/Alpha–beta_pruning#CITEREFRussellNorvig2021 |
| ^ | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-FOOTNOTERussellNorvig2021154_15-0 |
| Russell & Norvig 2021 | https://en.wikipedia.org/wiki/Alpha–beta_pruning#CITEREFRussellNorvig2021 |
| ^ | https://en.wikipedia.org/wiki/Alpha–beta_pruning#cite_ref-16 |
| Pearl, Judea | https://en.wikipedia.org/wiki/Judea_Pearl |
| Korf, Richard | https://en.wikipedia.org/wiki/Richard_E._Korf |
| doi | https://en.wikipedia.org/wiki/Doi_(identifier) |
| 10.1146/annurev.cs.02.060187.002315 | https://doi.org/10.1146%2Fannurev.cs.02.060187.002315 |
| edit | https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&action=edit§ion=9 |
| Russell, Stuart J. | https://en.wikipedia.org/wiki/Stuart_J._Russell |
| Norvig, Peter. | https://en.wikipedia.org/wiki/Peter_Norvig |
| Artificial Intelligence: A Modern Approach | https://en.wikipedia.org/wiki/Artificial_Intelligence:_A_Modern_Approach |
| ISBN | https://en.wikipedia.org/wiki/ISBN_(identifier) |
| 9780134610993 | https://en.wikipedia.org/wiki/Special:BookSources/9780134610993 |
| LCCN | https://en.wikipedia.org/wiki/LCCN_(identifier) |
| 20190474 | https://lccn.loc.gov/20190474 |
| Oreilly Media | https://en.wikipedia.org/wiki/Oreilly_Media |
| ISBN | https://en.wikipedia.org/wiki/ISBN_(identifier) |
| 978-0-596-51624-6 | https://en.wikipedia.org/wiki/Special:BookSources/978-0-596-51624-6 |
| Pearl, Judea | https://en.wikipedia.org/wiki/Judea_Pearl |
| Heuristics: Intelligent Search Strategies for Computer Problem Solving | https://archive.org/details/heuristicsintell00pear |
| ISBN | https://en.wikipedia.org/wiki/ISBN_(identifier) |
| 978-0-201-05594-8 | https://en.wikipedia.org/wiki/Special:BookSources/978-0-201-05594-8 |
| OCLC | https://en.wikipedia.org/wiki/OCLC_(identifier) |
| 1035596197 | https://search.worldcat.org/oclc/1035596197 |
| ISBN | https://en.wikipedia.org/wiki/ISBN_(identifier) |
| 0-8357-1527-2 | https://en.wikipedia.org/wiki/Special:BookSources/0-8357-1527-2 |
| v | https://en.wikipedia.org/wiki/Template:Graph_traversal_algorithms |
| t | https://en.wikipedia.org/wiki/Template_talk:Graph_traversal_algorithms |
| e | https://en.wikipedia.org/wiki/Special:EditPage/Template:Graph_traversal_algorithms |
| Graph | https://en.wikipedia.org/wiki/Graph_traversal |
| tree | https://en.wikipedia.org/wiki/Tree_traversal |
| Search | https://en.wikipedia.org/wiki/Graph_traversal |
| A* | https://en.wikipedia.org/wiki/A*_search_algorithm |
| IDA* | https://en.wikipedia.org/wiki/Iterative_deepening_A* |
| LPA* | https://en.wikipedia.org/wiki/Lifelong_Planning_A* |
| SMA* | https://en.wikipedia.org/wiki/SMA* |
| Best-first search | https://en.wikipedia.org/wiki/Best-first_search |
| Beam search | https://en.wikipedia.org/wiki/Beam_search |
| Bidirectional search | https://en.wikipedia.org/wiki/Bidirectional_search |
| Breadth-first search | https://en.wikipedia.org/wiki/Breadth-first_search |
| Lexicographic | https://en.wikipedia.org/wiki/Lexicographic_breadth-first_search |
| Parallel | https://en.wikipedia.org/wiki/Parallel_breadth-first_search |
| B* | https://en.wikipedia.org/wiki/B* |
| Depth-first search | https://en.wikipedia.org/wiki/Depth-first_search |
| Iterative deepening | https://en.wikipedia.org/wiki/Iterative_deepening_depth-first_search |
| D* | https://en.wikipedia.org/wiki/D* |
| Fringe search | https://en.wikipedia.org/wiki/Fringe_search |
| Jump point search | https://en.wikipedia.org/wiki/Jump_point_search |
| Monte Carlo tree search | https://en.wikipedia.org/wiki/Monte_Carlo_tree_search |
| SSS* | https://en.wikipedia.org/wiki/SSS* |
| Shortest path | https://en.wikipedia.org/wiki/Shortest_path_problem |
| Bellman–Ford | https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm |
| Dijkstra's | https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm |
| Floyd–Warshall | https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm |
| Johnson's | https://en.wikipedia.org/wiki/Johnson%27s_algorithm |
| Shortest path faster | https://en.wikipedia.org/wiki/Shortest_path_faster_algorithm |
| Yen's | https://en.wikipedia.org/wiki/Yen%27s_algorithm |
| Minimum spanning tree | https://en.wikipedia.org/wiki/Minimum_spanning_tree |
| Borůvka's | https://en.wikipedia.org/wiki/Bor%C5%AFvka%27s_algorithm |
| Kruskal's | https://en.wikipedia.org/wiki/Kruskal%27s_algorithm |
| Prim's | https://en.wikipedia.org/wiki/Prim%27s_algorithm |
| Reverse-delete | https://en.wikipedia.org/wiki/Reverse-delete_algorithm |
| List of graph search algorithms | https://en.wikipedia.org/wiki/List_of_algorithms#Graph_search |
| v | https://en.wikipedia.org/wiki/Template:Game_theory |
| t | https://en.wikipedia.org/wiki/Template_talk:Game_theory |
| e | https://en.wikipedia.org/wiki/Special:EditPage/Template:Game_theory |
| Game theory | https://en.wikipedia.org/wiki/Game_theory |
| Glossary | https://en.wikipedia.org/wiki/Glossary_of_game_theory |
| Game theorists | https://en.wikipedia.org/wiki/List_of_game_theorists |
| Games | https://en.wikipedia.org/wiki/List_of_games_in_game_theory |
| game theory | https://en.wikipedia.org/wiki/Game_theory |
| Definitions | https://en.wikipedia.org/wiki/Game_theory#Basic_concepts |
| Asynchrony | https://en.wikipedia.org/wiki/Asynchrony_(game_theory) |
| Bayesian regret | https://en.wikipedia.org/wiki/Bayesian_regret |
| Best response | https://en.wikipedia.org/wiki/Best_response |
| Bounded rationality | https://en.wikipedia.org/wiki/Bounded_rationality |
| Cheap talk | https://en.wikipedia.org/wiki/Cheap_talk |
| Coalition | https://en.wikipedia.org/wiki/Coalition |
| Complete contract | https://en.wikipedia.org/wiki/Complete_contract |
| Complete information | https://en.wikipedia.org/wiki/Complete_information |
| Complete mixing | https://en.wikipedia.org/wiki/Complete_mixing |
| Conjectural variation | https://en.wikipedia.org/wiki/Conjectural_variation |
| Contingent cooperator | https://en.wikipedia.org/wiki/Contingent_cooperator |
| Coopetition | https://en.wikipedia.org/wiki/Coopetition |
| Cooperative game theory | https://en.wikipedia.org/wiki/Cooperative_game_theory |
| Dynamic inconsistency | https://en.wikipedia.org/wiki/Dynamic_inconsistency |
| Escalation of commitment | https://en.wikipedia.org/wiki/Escalation_of_commitment |
| Farsightedness | https://en.wikipedia.org/wiki/Farsightedness_(game_theory) |
| Game semantics | https://en.wikipedia.org/wiki/Game_semantics |
| Hierarchy of beliefs | https://en.wikipedia.org/wiki/Hierarchy_of_beliefs |
| Imperfect information | https://en.wikipedia.org/wiki/Imperfect_information |
| Incomplete information | https://en.wikipedia.org/wiki/Incomplete_information |
| Information set | https://en.wikipedia.org/wiki/Information_set_(game_theory) |
| Move by nature | https://en.wikipedia.org/wiki/Move_by_nature |
| Mutual knowledge | https://en.wikipedia.org/wiki/Mutual_knowledge |
| Non-cooperative game theory | https://en.wikipedia.org/wiki/Non-cooperative_game_theory |
| Non-credible threat | https://en.wikipedia.org/wiki/Non-credible_threat |
| Outcome | https://en.wikipedia.org/wiki/Outcome_(game_theory) |
| Perfect information | https://en.wikipedia.org/wiki/Perfect_information |
| Perfect recall | https://en.wikipedia.org/wiki/Perfect_recall_(game_theory) |
| Ply | https://en.wikipedia.org/wiki/Ply_(game_theory) |
| Preference | https://en.wikipedia.org/wiki/Preference_(economics) |
| Rationality | https://en.wikipedia.org/wiki/Rationality |
| Sequential game | https://en.wikipedia.org/wiki/Sequential_game |
| Simultaneous action selection | https://en.wikipedia.org/wiki/Simultaneous_action_selection |
| Spite | https://en.wikipedia.org/wiki/Spite_(game_theory) |
| Strategic complements | https://en.wikipedia.org/wiki/Strategic_complements |
| Strategic dominance | https://en.wikipedia.org/wiki/Strategic_dominance |
| Strategic form | https://en.wikipedia.org/wiki/Strategic_form |
| Strategic interaction | https://en.wikipedia.org/wiki/Strategic_interaction |
| Strategic move | https://en.wikipedia.org/wiki/Strategic_move |
| Strategy | https://en.wikipedia.org/wiki/Strategy_(game_theory) |
| Subgame | https://en.wikipedia.org/wiki/Subgame |
| Succinct game | https://en.wikipedia.org/wiki/Succinct_game |
| Topological game | https://en.wikipedia.org/wiki/Topological_game |
| Tragedy of the commons | https://en.wikipedia.org/wiki/Tragedy_of_the_commons |
| Uncorrelated asymmetry | https://en.wikipedia.org/wiki/Uncorrelated_asymmetry |
| Equilibriumconcepts | https://en.wikipedia.org/wiki/Economic_equilibrium |
| Backward induction | https://en.wikipedia.org/wiki/Backward_induction |
| Bayes correlated equilibrium | https://en.wikipedia.org/wiki/Bayes_correlated_equilibrium |
| Bayesian efficiency | https://en.wikipedia.org/wiki/Bayesian_efficiency |
| Bayesian game | https://en.wikipedia.org/wiki/Bayesian_game |
| Bayesian Nash equilibrium | https://en.wikipedia.org/wiki/Bayesian_Nash_equilibrium |
| Berge equilibrium | https://en.wikipedia.org/wiki/Berge_equilibrium |
| Bertrand–Edgeworth model | https://en.wikipedia.org/wiki/Bertrand%E2%80%93Edgeworth_model |
| Coalition-proof Nash equilibrium | https://en.wikipedia.org/wiki/Coalition-proof_Nash_equilibrium |
| Core | https://en.wikipedia.org/wiki/Core_(game_theory) |
| Correlated equilibrium | https://en.wikipedia.org/wiki/Correlated_equilibrium |
| Cursed equilibrium | https://en.wikipedia.org/wiki/Cursed_equilibrium |
| Edgeworth price cycle | https://en.wikipedia.org/wiki/Edgeworth_price_cycle |
| Epsilon-equilibrium | https://en.wikipedia.org/wiki/Epsilon-equilibrium |
| Gibbs equilibrium | https://en.wikipedia.org/wiki/Gibbs_measure |
| Incomplete contracts | https://en.wikipedia.org/wiki/Incomplete_contracts |
| Inequity aversion | https://en.wikipedia.org/wiki/Inequity_aversion |
| Individual rationality | https://en.wikipedia.org/wiki/Individual_rationality |
| Iterated elimination of dominated strategies | https://en.wikipedia.org/wiki/Iterated_elimination_of_dominated_strategies |
| Markov perfect equilibrium | https://en.wikipedia.org/wiki/Markov_perfect_equilibrium |
| Mertens-stable equilibrium | https://en.wikipedia.org/wiki/Mertens-stable_equilibrium |
| Nash equilibrium | https://en.wikipedia.org/wiki/Nash_equilibrium |
| Open-loop model | https://en.wikipedia.org/wiki/Open-loop_model |
| Pareto efficiency | https://en.wikipedia.org/wiki/Pareto_efficiency |
| Payoff dominance | https://en.wikipedia.org/wiki/Payoff_dominance |
| Perfect Bayesian equilibrium | https://en.wikipedia.org/wiki/Perfect_Bayesian_equilibrium |
| Price of anarchy | https://en.wikipedia.org/wiki/Price_of_anarchy |
| Program equilibrium | https://en.wikipedia.org/wiki/Program_equilibrium |
| Proper equilibrium | https://en.wikipedia.org/wiki/Proper_equilibrium |
| Quantal response equilibrium | https://en.wikipedia.org/wiki/Quantal_response_equilibrium |
| Quasi-perfect equilibrium | https://en.wikipedia.org/wiki/Quasi-perfect_equilibrium |
| Rational agent | https://en.wikipedia.org/wiki/Rational_agent |
| Rationalizability | https://en.wikipedia.org/wiki/Rationalizability |
| Rationalizable strategy | https://en.wikipedia.org/wiki/Rationalizable_strategy |
| Satisfaction equilibrium | https://en.wikipedia.org/wiki/Satisfaction_equilibrium |
| Self-confirming equilibrium | https://en.wikipedia.org/wiki/Self-confirming_equilibrium |
| Sequential equilibrium | https://en.wikipedia.org/wiki/Sequential_equilibrium |
| Shapley value | https://en.wikipedia.org/wiki/Shapley_value |
| Strong Nash equilibrium | https://en.wikipedia.org/wiki/Strong_Nash_equilibrium |
| Subgame perfect equilibrium | https://en.wikipedia.org/wiki/Subgame_perfect_equilibrium |
| Trembling hand equilibrium | https://en.wikipedia.org/wiki/Trembling_hand_perfect_equilibrium |
| Strategies | https://en.wikipedia.org/wiki/Strategy_(game_theory) |
| Appeasement | https://en.wikipedia.org/wiki/Appeasement |
| Bid shading | https://en.wikipedia.org/wiki/Bid_shading |
| Cheap talk | https://en.wikipedia.org/wiki/Cheap_talk |
| Collusion | https://en.wikipedia.org/wiki/Collusion |
| Commitment device | https://en.wikipedia.org/wiki/Commitment_device |
| De-escalation | https://en.wikipedia.org/wiki/De-escalation |
| Deterrence | https://en.wikipedia.org/wiki/Deterrence_theory |
| Escalation | https://en.wikipedia.org/wiki/Conflict_escalation |
| Fictitious play | https://en.wikipedia.org/wiki/Fictitious_play |
| Focal point | https://en.wikipedia.org/wiki/Focal_point_(game_theory) |
| Grim trigger | https://en.wikipedia.org/wiki/Grim_trigger |
| Hobbesian trap | https://en.wikipedia.org/wiki/Hobbesian_trap |
| Markov strategy | https://en.wikipedia.org/wiki/Markov_strategy |
| Max-dominated strategy | https://en.wikipedia.org/wiki/Max-dominated_strategy |
| Mixed strategy | https://en.wikipedia.org/wiki/Strategy_(game_theory)#Mixed_strategy |
| Pure strategy | https://en.wikipedia.org/wiki/Strategy_(game_theory) |
| Tit for tat | https://en.wikipedia.org/wiki/Tit_for_tat |
| Win–stay, lose–switch | https://en.wikipedia.org/wiki/Win%E2%80%93stay,_lose%E2%80%93switch |
| Games | https://en.wikipedia.org/wiki/List_of_games_in_game_theory |
| All-pay auction | https://en.wikipedia.org/wiki/All-pay_auction |
| Battle of the sexes | https://en.wikipedia.org/wiki/Battle_of_the_sexes_(game_theory) |
| Nash bargaining game | https://en.wikipedia.org/wiki/Bargaining_problem |
| Bertrand competition | https://en.wikipedia.org/wiki/Bertrand_competition |
| Blotto game | https://en.wikipedia.org/wiki/Blotto_game |
| Centipede game | https://en.wikipedia.org/wiki/Centipede_game |
| Coordination game | https://en.wikipedia.org/wiki/Coordination_game |
| Cournot competition | https://en.wikipedia.org/wiki/Cournot_competition |
| Deadlock | https://en.wikipedia.org/wiki/Deadlock_(game_theory) |
| Dictator game | https://en.wikipedia.org/wiki/Dictator_game |
| Trust game | https://en.wikipedia.org/wiki/Dictator_game#Trust_game |
| Diner's dilemma | https://en.wikipedia.org/wiki/Unscrupulous_diner%27s_dilemma |
| Dollar auction | https://en.wikipedia.org/wiki/Dollar_auction |
| El Farol Bar problem | https://en.wikipedia.org/wiki/El_Farol_Bar_problem |
| Electronic mail game | https://en.wikipedia.org/wiki/Electronic_mail_game |
| Gift-exchange game | https://en.wikipedia.org/wiki/Gift-exchange_game |
| Guess 2/3 of the average | https://en.wikipedia.org/wiki/Guess_2/3_of_the_average |
| Keynesian beauty contest | https://en.wikipedia.org/wiki/Keynesian_beauty_contest |
| Kuhn poker | https://en.wikipedia.org/wiki/Kuhn_poker |
| Lewis signaling game | https://en.wikipedia.org/wiki/Lewis_signaling_game |
| Matching pennies | https://en.wikipedia.org/wiki/Matching_pennies |
| Obligationes | https://en.wikipedia.org/wiki/Obligationes |
| Optional prisoner's dilemma | https://en.wikipedia.org/wiki/Optional_prisoner%27s_dilemma |
| Pirate game | https://en.wikipedia.org/wiki/Pirate_game |
| Prisoner's dilemma | https://en.wikipedia.org/wiki/Prisoner%27s_dilemma |
| Public goods game | https://en.wikipedia.org/wiki/Public_goods_game |
| Rendezvous problem | https://en.wikipedia.org/wiki/Rendezvous_problem |
| Rock paper scissors | https://en.wikipedia.org/wiki/Rock_paper_scissors |
| Stackelberg competition | https://en.wikipedia.org/wiki/Stackelberg_competition |
| Stag hunt | https://en.wikipedia.org/wiki/Stag_hunt |
| Traveler's dilemma | https://en.wikipedia.org/wiki/Traveler%27s_dilemma |
| Ultimatum game | https://en.wikipedia.org/wiki/Ultimatum_game |
| Volunteer's dilemma | https://en.wikipedia.org/wiki/Volunteer%27s_dilemma |
| War of attrition | https://en.wikipedia.org/wiki/War_of_attrition_(game) |
| Theorems | https://en.wikipedia.org/wiki/Game_theory#Theorems |
| Arrow's impossibility theorem | https://en.wikipedia.org/wiki/Arrow%27s_impossibility_theorem |
| Aumann's agreement theorem | https://en.wikipedia.org/wiki/Aumann%27s_agreement_theorem |
| Brouwer fixed-point theorem | https://en.wikipedia.org/wiki/Brouwer_fixed-point_theorem |
| Competitive altruism | https://en.wikipedia.org/wiki/Competitive_altruism |
| Folk theorem | https://en.wikipedia.org/wiki/Folk_theorem_(game_theory) |
| Gibbard–Satterthwaite theorem | https://en.wikipedia.org/wiki/Gibbard%E2%80%93Satterthwaite_theorem |
| Gibbs lemma | https://en.wikipedia.org/wiki/Gibbs_lemma |
| Glicksberg's theorem | https://en.wikipedia.org/wiki/Glicksberg%27s_theorem |
| Kakutani fixed-point theorem | https://en.wikipedia.org/wiki/Kakutani_fixed-point_theorem |
| Kuhn's theorem | https://en.wikipedia.org/wiki/Kuhn%27s_theorem |
| One-shot deviation principle | https://en.wikipedia.org/wiki/One-shot_deviation_principle |
| Prim–Read theory | https://en.wikipedia.org/wiki/Prim%E2%80%93Read_theory |
| Rational ignorance | https://en.wikipedia.org/wiki/Rational_ignorance |
| Rational irrationality | https://en.wikipedia.org/wiki/Rational_irrationality |
| Sperner's lemma | https://en.wikipedia.org/wiki/Sperner%27s_lemma |
| Zermelo's theorem | https://en.wikipedia.org/wiki/Zermelo%27s_theorem_(game_theory) |
| Algorithmic game theory | https://en.wikipedia.org/wiki/Algorithmic_game_theory |
| Behavioral game theory | https://en.wikipedia.org/wiki/Behavioral_game_theory |
| Behavioral strategy | https://en.wikipedia.org/wiki/Behavioral_strategy |
| Compositional game theory | https://en.wikipedia.org/wiki/Compositional_game_theory |
| Confrontation analysis | https://en.wikipedia.org/wiki/Confrontation_analysis |
| Contract theory | https://en.wikipedia.org/wiki/Contract_theory |
| Drama theory | https://en.wikipedia.org/wiki/Drama_theory |
| Graphical game theory | https://en.wikipedia.org/wiki/Graphical_game_theory |
| Heresthetic | https://en.wikipedia.org/wiki/Heresthetic |
| Mean-field game theory | https://en.wikipedia.org/wiki/Mean-field_game_theory |
| Negotiation theory | https://en.wikipedia.org/wiki/Negotiation_theory |
| Quantum game theory | https://en.wikipedia.org/wiki/Quantum_game_theory |
| Social software | https://en.wikipedia.org/wiki/Social_software_(research_field) |
| Albert W. Tucker | https://en.wikipedia.org/wiki/Albert_W._Tucker |
| Alvin E. Roth | https://en.wikipedia.org/wiki/Alvin_E._Roth |
| Amos Tversky | https://en.wikipedia.org/wiki/Amos_Tversky |
| Antoine Augustin Cournot | https://en.wikipedia.org/wiki/Antoine_Augustin_Cournot |
| Ariel Rubinstein | https://en.wikipedia.org/wiki/Ariel_Rubinstein |
| David Gale | https://en.wikipedia.org/wiki/David_Gale |
| David K. Levine | https://en.wikipedia.org/wiki/David_K._Levine |
| David M. Kreps | https://en.wikipedia.org/wiki/David_M._Kreps |
| Donald B. Gillies | https://en.wikipedia.org/wiki/Donald_B._Gillies |
| Drew Fudenberg | https://en.wikipedia.org/wiki/Drew_Fudenberg |
| Eric Maskin | https://en.wikipedia.org/wiki/Eric_Maskin |
| Harold W. Kuhn | https://en.wikipedia.org/wiki/Harold_W._Kuhn |
| Herbert Simon | https://en.wikipedia.org/wiki/Herbert_A._Simon |
| Herbert Scarf | https://en.wikipedia.org/wiki/Herbert_Scarf |
| Hervé Moulin | https://en.wikipedia.org/wiki/Herv%C3%A9_Moulin |
| Jean Tirole | https://en.wikipedia.org/wiki/Jean_Tirole |
| Jean-François Mertens | https://en.wikipedia.org/wiki/Jean-Fran%C3%A7ois_Mertens |
| Jennifer Tour Chayes | https://en.wikipedia.org/wiki/Jennifer_Tour_Chayes |
| Ken Binmore | https://en.wikipedia.org/wiki/Ken_Binmore |
| Kenneth Arrow | https://en.wikipedia.org/wiki/Kenneth_Arrow |
| Leonid Hurwicz | https://en.wikipedia.org/wiki/Leonid_Hurwicz |
| Lloyd Shapley | https://en.wikipedia.org/wiki/Lloyd_Shapley |
| Martin Shubik | https://en.wikipedia.org/wiki/Martin_Shubik |
| Melvin Dresher | https://en.wikipedia.org/wiki/Melvin_Dresher |
| Merrill M. Flood | https://en.wikipedia.org/wiki/Merrill_M._Flood |
| Olga Bondareva | https://en.wikipedia.org/wiki/Olga_Bondareva |
| Oskar Morgenstern | https://en.wikipedia.org/wiki/Oskar_Morgenstern |
| Paul Milgrom | https://en.wikipedia.org/wiki/Paul_Milgrom |
| Peyton Young | https://en.wikipedia.org/wiki/Peyton_Young |
| Reinhard Selten | https://en.wikipedia.org/wiki/Reinhard_Selten |
| Robert Aumann | https://en.wikipedia.org/wiki/Robert_Aumann |
| Robert Axelrod | https://en.wikipedia.org/wiki/Robert_Axelrod_(political_scientist) |
| Robert B. Wilson | https://en.wikipedia.org/wiki/Robert_B._Wilson |
| Roger Myerson | https://en.wikipedia.org/wiki/Roger_Myerson |
| Samuel Bowles | https://en.wikipedia.org/wiki/Samuel_Bowles_(economist) |
| Suzanne Scotchmer | https://en.wikipedia.org/wiki/Suzanne_Scotchmer |
| Thomas Schelling | https://en.wikipedia.org/wiki/Thomas_Schelling |
| William Vickrey | https://en.wikipedia.org/wiki/William_Vickrey |
| Combinatorial game theory | https://en.wikipedia.org/wiki/Combinatorial_game_theory |
| Combinatorial explosion | https://en.wikipedia.org/wiki/Combinatorial_explosion |
| Determinacy | https://en.wikipedia.org/wiki/Determinacy |
| Disjunctive sum | https://en.wikipedia.org/wiki/Disjunctive_sum |
| First-player and second-player win | https://en.wikipedia.org/wiki/First-player_and_second-player_win |
| Game complexity | https://en.wikipedia.org/wiki/Game_complexity |
| Game tree | https://en.wikipedia.org/wiki/Game_tree |
| Impartial game | https://en.wikipedia.org/wiki/Impartial_game |
| Misère | https://en.wikipedia.org/wiki/Mis%C3%A8re |
| Partisan game | https://en.wikipedia.org/wiki/Partisan_game |
| Solved game | https://en.wikipedia.org/wiki/Solved_game |
| Sprague–Grundy theorem | https://en.wikipedia.org/wiki/Sprague%E2%80%93Grundy_theorem |
| Strategy-stealing argument | https://en.wikipedia.org/wiki/Strategy-stealing_argument |
| Zugzwang | https://en.wikipedia.org/wiki/Zugzwang |
| Chess | https://en.wikipedia.org/wiki/Chess |
| Chomp | https://en.wikipedia.org/wiki/Chomp |
| Clobber | https://en.wikipedia.org/wiki/Clobber |
| Cram | https://en.wikipedia.org/wiki/Cram_(game) |
| Domineering | https://en.wikipedia.org/wiki/Domineering |
| Hackenbush | https://en.wikipedia.org/wiki/Hackenbush |
| Nim | https://en.wikipedia.org/wiki/Nim |
| Notakto | https://en.wikipedia.org/wiki/Notakto |
| Subtract a square | https://en.wikipedia.org/wiki/Subtract_a_square |
| Sylver coinage | https://en.wikipedia.org/wiki/Sylver_coinage |
| Toads and Frogs | https://en.wikipedia.org/wiki/Toads_and_Frogs |
| Mex | https://en.wikipedia.org/wiki/Mex_(mathematics) |
| Nimber | https://en.wikipedia.org/wiki/Nimber |
| On Numbers and Games | https://en.wikipedia.org/wiki/On_Numbers_and_Games |
| Star | https://en.wikipedia.org/wiki/Star_(game_theory) |
| Surreal number | https://en.wikipedia.org/wiki/Surreal_number |
| Winning Ways for Your Mathematical Plays | https://en.wikipedia.org/wiki/Winning_Ways_for_Your_Mathematical_Plays |
| Expectiminimax | https://en.wikipedia.org/wiki/Expectiminimax |
| Minimax | https://en.wikipedia.org/wiki/Minimax |
| Monte Carlo tree search | https://en.wikipedia.org/wiki/Monte_Carlo_tree_search |
| Negamax | https://en.wikipedia.org/wiki/Negamax |
| Paranoid algorithm | https://en.wikipedia.org/wiki/Paranoid_algorithm |
| Principal variation search | https://en.wikipedia.org/wiki/Principal_variation_search |
| Claude Shannon | https://en.wikipedia.org/wiki/Claude_Shannon |
| John Conway | https://en.wikipedia.org/wiki/John_Conway |
| John von Neumann | https://en.wikipedia.org/wiki/John_von_Neumann |
| Evolutionary game theory | https://en.wikipedia.org/wiki/Evolutionary_game_theory |
| Bishop–Cannings theorem | https://en.wikipedia.org/wiki/Bishop%E2%80%93Cannings_theorem |
| Evolution and the Theory of Games | https://en.wikipedia.org/wiki/Evolution_and_the_Theory_of_Games |
| Evolutionarily stable set | https://en.wikipedia.org/wiki/Evolutionarily_stable_set |
| Evolutionarily stable state | https://en.wikipedia.org/wiki/Evolutionarily_stable_state |
| Evolutionarily stable strategy | https://en.wikipedia.org/wiki/Evolutionarily_stable_strategy |
| Replicator equation | https://en.wikipedia.org/wiki/Replicator_equation |
| Risk dominance | https://en.wikipedia.org/wiki/Risk_dominance |
| Stochastically stable equilibrium | https://en.wikipedia.org/wiki/Stochastically_stable_equilibrium |
| Weak evolutionarily stable strategy | https://en.wikipedia.org/wiki/Weak_evolutionarily_stable_strategy |
| Chicken | https://en.wikipedia.org/wiki/Chicken_(game) |
| Stag hunt | https://en.wikipedia.org/wiki/Stag_hunt |
| Cultural group selection | https://en.wikipedia.org/wiki/Cultural_group_selection |
| Fisher's principle | https://en.wikipedia.org/wiki/Fisher%27s_principle |
| Mobbing | https://en.wikipedia.org/wiki/Mobbing_(animal_behavior) |
| Terminal investment hypothesis | https://en.wikipedia.org/wiki/Terminal_investment_hypothesis |
| John Maynard Smith | https://en.wikipedia.org/wiki/John_Maynard_Smith |
| Robert Axelrod | https://en.wikipedia.org/wiki/Robert_Axelrod_(political_scientist) |
| Mechanism design | https://en.wikipedia.org/wiki/Mechanism_design |
| Algorithmic mechanism design | https://en.wikipedia.org/wiki/Algorithmic_mechanism_design |
| Bayesian-optimal mechanism | https://en.wikipedia.org/wiki/Bayesian-optimal_mechanism |
| Incentive compatibility | https://en.wikipedia.org/wiki/Incentive_compatibility |
| Market design | https://en.wikipedia.org/wiki/Market_design |
| Myerson ironing | https://en.wikipedia.org/wiki/Myerson_ironing |
| Monotonicity | https://en.wikipedia.org/wiki/Monotonicity_(mechanism_design) |
| Participation constraint | https://en.wikipedia.org/wiki/Participation_constraint_(mechanism_design) |
| Revelation principle | https://en.wikipedia.org/wiki/Revelation_principle |
| Strategyproofness | https://en.wikipedia.org/wiki/Strategyproofness |
| Vickrey–Clarke–Groves mechanism | https://en.wikipedia.org/wiki/Vickrey%E2%80%93Clarke%E2%80%93Groves_mechanism |
| Virtual valuation | https://en.wikipedia.org/wiki/Virtual_valuation |
| Myerson–Satterthwaite theorem | https://en.wikipedia.org/wiki/Myerson%E2%80%93Satterthwaite_theorem |
| Revenue equivalence | https://en.wikipedia.org/wiki/Revenue_equivalence |
| Border's theorem | https://en.wikipedia.org/wiki/Border%27s_theorem |
| Digital goods auction | https://en.wikipedia.org/wiki/Digital_goods_auction |
| Knapsack auction | https://en.wikipedia.org/wiki/Knapsack_auction |
| Truthful cake-cutting | https://en.wikipedia.org/wiki/Truthful_cake-cutting |
| Bertrand paradox | https://en.wikipedia.org/wiki/Bertrand_paradox_(economics) |
| Chainstore paradox | https://en.wikipedia.org/wiki/Chainstore_paradox |
| Computational complexity of games | https://en.wikipedia.org/wiki/Computational_complexity_of_games |
| Helly metric | https://en.wikipedia.org/wiki/Helly_metric |
| Multi-agent system | https://en.wikipedia.org/wiki/Multi-agent_system |
| PPAD-complete | https://en.wikipedia.org/wiki/PPAD_(complexity) |
| https://en.wikipedia.org/wiki/File:Nuvola_apps_edu_mathematics_blue-p.svg |
| Mathematics portal | https://en.wikipedia.org/wiki/Portal:Mathematics |
| https://en.wikipedia.org/wiki/File:Commons-logo.svg |
| Commons | https://commons.wikimedia.org/wiki/Category:Game_theory |
| WikiProject | https://en.wikipedia.org/wiki/Wikipedia:WikiProject_Game_theory |
| Category | https://en.wikipedia.org/wiki/Category:Game_theory |
| https://en.wikipedia.org/w/index.php?title=Alpha–beta_pruning&oldid=1332549876 | https://en.wikipedia.org/w/index.php?title=Alpha–beta_pruning&oldid=1332549876 |
| Categories | https://en.wikipedia.org/wiki/Help:Category |
| Game artificial intelligence | https://en.wikipedia.org/wiki/Category:Game_artificial_intelligence |
| Graph algorithms | https://en.wikipedia.org/wiki/Category:Graph_algorithms |
| Optimization algorithms and methods | https://en.wikipedia.org/wiki/Category:Optimization_algorithms_and_methods |
| Search algorithms | https://en.wikipedia.org/wiki/Category:Search_algorithms |
| Combinatorial game theory | https://en.wikipedia.org/wiki/Category:Combinatorial_game_theory |
| Articles with short description | https://en.wikipedia.org/wiki/Category:Articles_with_short_description |
| Short description is different from Wikidata | https://en.wikipedia.org/wiki/Category:Short_description_is_different_from_Wikidata |
| Articles with example pseudocode | https://en.wikipedia.org/wiki/Category:Articles_with_example_pseudocode |
| Creative Commons Attribution-ShareAlike 4.0 License | https://en.wikipedia.org/wiki/Wikipedia:Text_of_the_Creative_Commons_Attribution-ShareAlike_4.0_International_License |
| Terms of Use | https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Terms_of_Use |
| Privacy Policy | https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy |
| Wikimedia Foundation, Inc. | https://wikimediafoundation.org/ |
| Privacy policy | https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy |
| About Wikipedia | https://en.wikipedia.org/wiki/Wikipedia:About |
| Disclaimers | https://en.wikipedia.org/wiki/Wikipedia:General_disclaimer |
| Contact Wikipedia | https://en.wikipedia.org/wiki/Wikipedia:Contact_us |
| Legal & safety contacts | https://foundation.wikimedia.org/wiki/Special:MyLanguage/Legal:Wikimedia_Foundation_Legal_and_Safety_Contact_Information |
| Code of Conduct | https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Universal_Code_of_Conduct |
| Developers | https://developer.wikimedia.org |
| Statistics | https://stats.wikimedia.org/#/en.wikipedia.org |
| Cookie statement | https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Cookie_statement |
| Mobile view | https://en.wikipedia.org/w/index.php?title=Alpha%E2%80%93beta_pruning&mobileaction=toggle_view_mobile |
| https://www.wikimedia.org/ |
| https://www.mediawiki.org/ |
|
| https://en.wikipedia.org/wiki/Alpha–beta_pruning |
|
| https://en.wikipedia.org/wiki/Alpha–beta_pruning |
|
| https://en.wikipedia.org/wiki/Alpha–beta_pruning |
|
| https://en.wikipedia.org/wiki/Alpha–beta_pruning |
|
| https://en.wikipedia.org/wiki/Alpha–beta_pruning |
|
| https://en.wikipedia.org/wiki/Alpha–beta_pruning |
|
| https://en.wikipedia.org/wiki/Alpha–beta_pruning |
|
Add topic
| https://en.wikipedia.org/wiki/Alpha–beta_pruning |
