Nepedia
Back to Discover
Advanced Reader
💻

Computer Go

technology Maturity 7-9 Next article →

Computer Go is a specialized field of artificial intelligence (AI) research. Its goal is to create computer programs capable of playing the traditional board game Go. While games like chess were mastered by machines in the late 1990s, Go has remained a much harder challenge. Many researchers believed that defeating top human players was impossible without creating human-like intelligence. This difficulty arises because Go requires intense strategic thinking and intuition. The game is much more complex than chess due to the size of the board and the number of possible moves.

The primary difficulty stems from the massive scale of the 19x19 Go board. This board contains 361 intersections where stones can be placed. In chess, a player has only 20 possible opening moves. In Go, a player begins with 55 distinct legal moves. As the game progresses, the number of branching possibilities grows incredibly fast. This makes it nearly impossible for traditional algorithms to look far enough ahead. Algorithms like alpha-beta minimax, which worked well for chess, often fail on Go. They cannot process the vast number of potential future moves within a reasonable time.

Another major hurdle is the task of board evaluation. To play well, a program must assess which player is currently winning. In chess, computers can count material, such as how many pieces a player has left. In Go, evaluating a position is much more abstract. A program must determine if a group of stones is "alive" or "dead." This involves complex analysis of how stones connect and influence the board. A stone might not seem important immediately, but it can become vital much later. If a program evaluates a position incorrectly, it will make poor strategic choices.

For decades, computer Go programs were quite weak. In the 1980s and 1990s, even beginners could defeat them. In 1998, very strong players could win while giving the computer a 25-to-30 stone handicap. This is an enormous advantage that few humans would ever accept. In 1994, a program called Go Intellect lost all three games in a championship against youth players, even with a 15-stone handicap. Early researchers tried to use human-like expert knowledge to help these programs. However, these "knowledge-based" systems often had major weaknesses in their overall strategy. They could handle specific local situations but lacked a global understanding of the game.

Progress changed in 2006 when Rémi Coulom introduced the Monte Carlo tree search. This algorithm works by creating a tree of potential future moves. Instead of calculating every move perfectly, the computer performs many fast, random playouts. These playouts act as a way to "score" the different paths in the tree. While random play might seem inaccurate, the tree search helps correct the results. This method allowed programs like MoGo and Fuego to improve significantly. By 2009, programs could finally reach the "low-dan" level, which is the rank of an advanced amateur.

The most significant breakthrough came with the deep learning era. In 2015, the research group DeepMind developed AlphaGo. This program combined Monte Carlo tree search with deep learning, a method where computers learn from massive amounts of data. In 2016, AlphaGo played a historic match against Lee Sedol, a 9-dan professional. This was the first time a top professional played a computer without a handicap. AlphaGo won the match, marking a massive milestone in AI history.

DeepMind continued to push the boundaries of what was possible. In 2017, AlphaGo defeated Ke Jie, who was then the world's number one ranked player. Later that year, DeepMind revealed a version of AlphaGo that learned entirely through self-play. This version was even stronger, winning 89 out of 100 games against the previous version. Since then, many other teams have built high-level programs by following these techniques. Projects like Leela Zero and Tencent's Fine Art have also reached professional levels. The field has moved from weak, beginner-level tools to machines that can conquer the world's greatest champions.

667 words

Where will your curiosity go next?

Keep exploring at your chosen reading level.

More to explore

🔬 Go deeper

More advanced topics to explore

🪜 Step back

Simpler topics to build understanding

What is Nepedia?

A free, ad-free encyclopedia for children. Every article is written at five reading levels, so the same page works for a five-year-old and a fifteen-year-old — use the level switcher above to see this one change. No account needed to read.