{
  "id": "enwiki-001371050121",
  "slug": "computer-go",
  "title": "Computer Go",
  "qid": "",
  "lead": "Computer Go is the field of artificial intelligence (AI) dedicated to creating a computer program that plays the traditional board game Go. The field is sharply divided into two eras. Before 2015, programs were weak. The best efforts of the 1980s and 1990s produced only AIs that could be defeated by beginners, and AIs of the early 2000s were intermediate level at best. Professionals could defeat these programs even given handicaps of 10+ stones in favor of the AI. Many of the algorithms such as alpha-beta minimax that performed well as AIs for checkers and chess fell apart on Go's 19x19 board, as there were too many branching possibilities to consider. Creation of a human professional quality program with the techniques and hardware of the time was out of reach. Some AI researchers speculated that the problem was unsolvable without creation of human-like AI. The application of Monte Carlo tree search to Go algorithms provided a notable improvement in the late 2000s, with programs finally able to achieve a low-dan level: that of an advanced amateur. High-dan amateurs and professionals could still exploit these programs' weaknesses and win consistently, but computer performance had advanced past the intermediate (single-digit kyu) level.…",
  "body": "Computer Go is the field of artificial intelligence (AI) dedicated to creating a computer program that plays the traditional board game Go. The field is sharply divided into two eras. Before 2015, programs were weak. The best efforts of the 1980s and 1990s produced only AIs that could be defeated by beginners, and AIs of the early 2000s were intermediate level at best. Professionals could defeat these programs even given handicaps of 10+ stones in favor of the AI. Many of the algorithms such as alpha-beta minimax that performed well as AIs for checkers and chess fell apart on Go's 19x19 board, as there were too many branching possibilities to consider. Creation of a human professional quality program with the techniques and hardware of the time was out of reach. Some AI researchers speculated that the problem was unsolvable without creation of human-like AI. The application of Monte Carlo tree search to Go algorithms provided a notable improvement in the late 2000s, with programs finally able to achieve a low-dan level: that of an advanced amateur. High-dan amateurs and professionals could still exploit these programs' weaknesses and win consistently, but computer performance had advanced past the intermediate (single-digit kyu) level. The tantalizing unmet goal of defeating the best human players without a handicap, long thought unreachable, brought a burst of renewed interest. The key insight proved to be an application of machine learning and deep learning. DeepMind, a Google acquisition dedicated to AI research, produced AlphaGo in 2015 and announced it to the world in 2016. AlphaGo defeated Lee Sedol, a 9 dan professional, in a no-handicap match in 2016, then defeated Ke Jie in 2017, who at the time continuously held the world No. 1 ranking for two years. Just as checkers had fallen to machines in 1995 and chess in 1997, computer programs finally conquered humanity's greatest Go champions in 2016&ndash;2017. DeepMind did not release AlphaGo for public use, but various programs have been built since based on the journal articles DeepMind released describing AlphaGo and its variants. == Computer Go and other fields== Computer Go research results are being applied to other similar fields such as cognitive science, pattern recognition and machine learning. Combinatorial game theory, a branch of applied mathematics, is a topic relevant to computer Go. John H. Conway suggested applying surreal numbers to analysis of the endgame in Go. This idea has been further developed by Elwyn R. Berlekamp and David Wolfe in their book Mathematical Go. Go endgames have been proven to be PSPACE-hard if the absolute best move must be calculated on an arbitrary mostly filled board. Certain complicated situations such as Triple Ko, Quadruple Ko, Molasses Ko, and Moonshine Life make this problem difficult. (In practice, strong Monte Carlo algorithms can still handle normal Go endgame situations well enough, and the most complicated classes of life-and-death endgame problems are unlikely to come up in a high-level game.) Various difficult combinatorial problems (any NP-hard problem) can be converted to Go-like problems on a sufficiently large board; however, the same is true for other abstract board games, including chess and minesweeper, when suitably generalized to a board of arbitrary size. NP-complete problems do not tend in their general case to be easier for unaided humans than for suitably programmed computers: unaided humans are much worse than computers at solving, for example, instances of the subset sum problem. Minimalism in Ubiquitous Interface Design Wren, C. and Reynolds, C. (2004) Personal and Ubiquitous Computing, 8(5), pages 370–374. Video of computer Go vision system in operation shows interaction and users exploring Joseki and Fuseki. Monte-Carlo Go, presented by Markus Enzenberger, Computer Go Seminar, University of Alberta, April 2004 Monte-Carlo Go, written by B. Bouzy and B. Helmstetter from Scientific Literature Digital Library Static analysis of life and death in the game of Go, written by Ken Chen & Zhixing Chen, February 20, 1999 article describing the techniques underlying Mogo Published articles about computer Go on Ideosphere gives current estimate of whether a Go program will be best player in the world Information on the Go Text Protocol commonly used for interfacing Go playing engines with graphical clients and internet servers The Computer Go Room on the K Go Server (KGS) for online discussion and running \"bots\" Two Representative Computer Go Games, an article about two computer Go games played in 1999, one with two computers players, and the other a 29-stone handicap human-computer game What A Way to Go describes work at Microsoft Research on building a computer Go player. Cracking Go by Feng-hsiung Hsu, IEEE Spectrum magazine (October 2007) – Why it should be possible to build a Go machine stronger than any human player computer-go-dataset, SGF datasets of 1,645,958 games",
  "categories": [
    "102191776",
    "102876480",
    "10639524",
    "20153480",
    "20218389",
    "22945459",
    "23015890",
    "23100820",
    "23118434",
    "23603337",
    "24043274",
    "24623845",
    "24745107",
    "24745122",
    "44054354",
    "63706595",
    "7692542"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1371050121",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1787552412.0,
  "claims": [
    {
      "id": 29523939,
      "subject_qid": "",
      "subject_slug": "computer-go",
      "predicate": "publication date",
      "object_text": "1999",
      "object_num": 19990000.0,
      "object_unit": null,
      "polarity": 1,
      "qualifier": "",
      "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1371050121",
      "source_name": "Wikipedia",
      "source_tier": 3,
      "retrieved_at": 1792483462.5058107,
      "confidence": 0.95,
      "article_slug": "computer-go",
      "span_start": 212,
      "span_end": 261
    }
  ],
  "contradictions": [],
  "confidence": 0.95,
  "csl": {
    "id": "enwiki-001371050121",
    "type": "webpage",
    "title": "Computer Go",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/computer-go",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001371050121",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1371050121",
    "note": "Immutable snapshot enwiki-001371050121"
  }
}