{"id":249,"date":"2023-12-31T19:04:47","date_gmt":"2023-12-31T19:04:47","guid":{"rendered":"https:\/\/alandix.com\/aibook\/?page_id=249"},"modified":"2023-12-31T19:04:47","modified_gmt":"2023-12-31T19:04:47","slug":"chap11","status":"publish","type":"page","link":"https:\/\/alandix.com\/aibook\/second-edition\/toc2e\/chap11\/","title":{"rendered":"Chapter 11 \u2013 Game playing"},"content":{"rendered":"<div class=\"embedurl\" data-url=\"https:\/\/alandix.com\/books\/aibook\/content\/chaps\/chap11.html\" ><!--  Chapter 11 Game Playing  -->\n\n<script>\nvar chapnos = 11;\nvar json_url = \"https:\\\/\\\/alandix.com\\\/books\\\/aibook\\\/content\\\/chaps\\\/chap11.json\";\n<\/script>\n\n\n\n\n\t<object style=\"width:100%; aspect-ratio: 10 \/ 7;\" type=\"application\/pdf\" data=\"https:\/\/alandix.com\/books\/aibook\/content\/slides-pdf\/AI-chap-11.pdf\"><\/object>\n\t<p> Download <a href=\"https:\/\/alandix.com\/books\/aibook\/content\/slides-pptx\/AI-chap-11.pptx\" download>chapter slides<\/a><\/p>\n\n\n<h3> Contents <\/h3>\n<div class=\"toc\">\n<dl>\n<dt>11.1&nbsp;&nbsp;Overview<\/dt>\n<dt>11.2&nbsp;&nbsp;Introduction<\/dt>\n<dt>11.3&nbsp;&nbsp;Characteristics of Game Playing<\/dt>\n<dt>11.4&nbsp;&nbsp;Standard Games<\/dt><dd><dl>\n<dt>11.4.1&nbsp;&nbsp;A Simple Game Tree<\/dt>\n<dt>11.4.2&nbsp;&nbsp;Heuristics and Minimax Search<\/dt>\n<dt>11.4.3&nbsp;&nbsp;Horizon Problems<\/dt>\n<dt>11.4.4&nbsp;&nbsp;Alpha--beta Pruning<\/dt>\n<dt>11.4.5&nbsp;&nbsp;The Imperfect Opponent<\/dt>\n<\/dl><\/dd>\n<dt>11.5&nbsp;&nbsp;Non-zero-sum Games and Simultaneous Play<\/dt><dd><dl>\n<dt>11.5.1&nbsp;&nbsp;The Prisoner&#039;s Dilemma<\/dt>\n<dt>11.5.2&nbsp;&nbsp;Searching the Game Tree<\/dt>\n<dt>11.5.3&nbsp;&nbsp;No Alpha--Beta Pruning<\/dt>\n<dt>11.5.4&nbsp;&nbsp;Pareto-optimality<\/dt>\n<dt>11.5.5&nbsp;&nbsp;Multi-party Competition and Co-operation<\/dt>\n<\/dl><\/dd>\n<dt>11.6&nbsp;&nbsp;The Adversary Is Life!<\/dt>\n<dt>11.7&nbsp;&nbsp;Probability<\/dt>\n<dt>11.8&nbsp;&nbsp;Neural Networks for Games<\/dt><dd><dl>\n<dt>11.8.1&nbsp;&nbsp;Where to Use a Neural Network<\/dt>\n<dt>11.8.2&nbsp;&nbsp;Training Data and Self Play<\/dt>\n<\/dl><\/dd>\n<dt>11.9&nbsp;&nbsp;Summary<\/dt>\n<\/dl><\/div>\n\n\n<h3> Glossary items referenced in this chapter <\/h3>\n<div class=\"toc\">\n<a href=\"https:\/\/alandix.com\/glossary\/aibook\/adversarial%20learning\">adversarial learning<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/agents\">agents<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/alpha-beta%20pruning\">alpha&amp;ndash;beta pruning<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/alphago\">AlphaGo<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/alphago%20zero\">AlphaGo Zero<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/analytical%20engine\">Analytical Engine<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/babbage-charles\">Babbage, Charles<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/bootstrapping\">bootstrapping<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/branch%20and%20bound%20search\">branch and bound search<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/branching%20factor\">branching factor<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/breadth%20first%20search\">breadth first search<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/chess%20heuristic\">chess heuristic<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/chess%20program\">chess program<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/coin-weighing%20problem\">coin-weighing problem<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/computer%20chess\">computer chess<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/cuban%20missile%20crisis\">Cuban missile crisis<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/deep%20neural%20network\">deep neural network<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/deterministic%20search\">deterministic search<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/distributed%20ai\">distributed AI<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/dominoes\">dominoes<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/game%20playing%21heuristics\">game playing!heuristics<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/game%20theory\">game theory<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/game%20tree\">game tree<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/genetic%20algorithm\">genetic algorithm<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/go\">Go<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/heuristic%20evaluation%20function\">heuristic evaluation function<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/hill%20climbing%20algorithm\">hill climbing algorithm<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/human%20intelligence\">human intelligence<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/iterative%20deepening\">iterative deepening<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/knowledge-rich%20search\">knowledge-rich search<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/lee%20sedol\">Lee Sedol<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/machine%20learning\">machine learning<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/magic%20square\">magic square<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/minimax%20score\">minimax score<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/minimax%20search\">minimax search<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/monte%20carlo%20tree%20search\">Monte Carlo tree search<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/neural%20network\">neural network<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/non-zero-sum%20game\">non-zero-sum game<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/noughts%20and%20crosses\">noughts and crosses<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/optimal%20solution\">optimal solution<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/pareto-optimal\">Pareto-optimal<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/pattern%20matching\">pattern matching<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/placing%20dominoes\">placing dominoes<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/plateau\">plateau<\/a>, <strong><a href=\"https:\/\/alandix.com\/glossary\/aibook\/policy%20network\">policy network<\/a><\/strong>, <strong><a href=\"https:\/\/alandix.com\/glossary\/aibook\/prisoner%27s%20dilemma\">prisoner&#039;s dilemma<\/a><\/strong>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/probabilistic%20reasoning\">probabilistic reasoning<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/probability\">probability<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/probability-based%20cut-off\">probability-based cut-off<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/risk%20avoidance\">risk avoidance<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/robotics\">robotics<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/search%20horizon\">search horizon<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/search%20space\">search space<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/search%20strategies\">search strategies<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/search%20tree\">search tree<\/a>, <strong><a href=\"https:\/\/alandix.com\/glossary\/aibook\/self%20play\">self play<\/a><\/strong>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/stochastic%20search\">stochastic search<\/a>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/uncertainty\">uncertainty<\/a>, <strong><a href=\"https:\/\/alandix.com\/glossary\/aibook\/value%20network\">value network<\/a><\/strong>, <a href=\"https:\/\/alandix.com\/glossary\/aibook\/zero-sum%20game\">zero-sum game<\/a><\/div>\n\n\n\n\n<\/div>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":2,"featured_media":0,"parent":221,"menu_order":11,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_themeisle_gutenberg_block_has_review":false,"footnotes":""},"class_list":["post-249","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/alandix.com\/aibook\/wp-json\/wp\/v2\/pages\/249","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/alandix.com\/aibook\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/alandix.com\/aibook\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/alandix.com\/aibook\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/alandix.com\/aibook\/wp-json\/wp\/v2\/comments?post=249"}],"version-history":[{"count":3,"href":"https:\/\/alandix.com\/aibook\/wp-json\/wp\/v2\/pages\/249\/revisions"}],"predecessor-version":[{"id":301,"href":"https:\/\/alandix.com\/aibook\/wp-json\/wp\/v2\/pages\/249\/revisions\/301"}],"up":[{"embeddable":true,"href":"https:\/\/alandix.com\/aibook\/wp-json\/wp\/v2\/pages\/221"}],"wp:attachment":[{"href":"https:\/\/alandix.com\/aibook\/wp-json\/wp\/v2\/media?parent=249"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}